./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:40:30,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:40:30,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:40:30,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:40:30,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:40:30,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:40:30,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:40:30,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:40:30,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:40:30,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:40:30,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:40:30,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:40:30,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:40:30,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:40:30,609 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:40:30,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:40:30,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:40:30,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:40:30,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:40:30,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:40:30,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:40:30,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:40:30,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:40:30,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:40:30,617 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:40:30,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:40:30,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:40:30,618 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:40:30,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:40:30,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:40:30,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:40:30,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:40:30,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:40:30,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:40:30,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:40:30,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:40:30,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:40:30,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:40:30,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:40:30,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:40:30,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:40:30,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:40:30,624 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 -> d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 [2024-11-08 23:40:30,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:40:30,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:40:30,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:40:30,916 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:40:30,916 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:40:30,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-11-08 23:40:32,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:40:32,632 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:40:32,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-11-08 23:40:32,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936d5c809/ec82937e66204f979b2b1f4ad4a2eefb/FLAG8ca60200a [2024-11-08 23:40:33,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/936d5c809/ec82937e66204f979b2b1f4ad4a2eefb [2024-11-08 23:40:33,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:40:33,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:40:33,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:40:33,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:40:33,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:40:33,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d3df3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33, skipping insertion in model container [2024-11-08 23:40:33,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:40:33,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2024-11-08 23:40:33,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:40:33,254 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:40:33,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2024-11-08 23:40:33,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:40:33,305 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:40:33,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33 WrapperNode [2024-11-08 23:40:33,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:40:33,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:40:33,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:40:33,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:40:33,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,389 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-08 23:40:33,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:40:33,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:40:33,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:40:33,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:40:33,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,434 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:40:33,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:40:33,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:40:33,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:40:33,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:40:33,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (1/1) ... [2024-11-08 23:40:33,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:40:33,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:40:33,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:40:33,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:40:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:40:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:40:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:40:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:40:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:40:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:40:33,621 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:40:33,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:40:34,023 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-08 23:40:34,024 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:40:34,043 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:40:34,043 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:40:34,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:40:34 BoogieIcfgContainer [2024-11-08 23:40:34,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:40:34,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:40:34,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:40:34,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:40:34,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:40:33" (1/3) ... [2024-11-08 23:40:34,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8365fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:40:34, skipping insertion in model container [2024-11-08 23:40:34,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:33" (2/3) ... [2024-11-08 23:40:34,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8365fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:40:34, skipping insertion in model container [2024-11-08 23:40:34,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:40:34" (3/3) ... [2024-11-08 23:40:34,051 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-11-08 23:40:34,064 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:40:34,065 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:40:34,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:40:34,127 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;@5ac5d681, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:40:34,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:40:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 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-11-08 23:40:34,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:40:34,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:34,149 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-11-08 23:40:34,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:34,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:34,155 INFO L85 PathProgramCache]: Analyzing trace with hash 442745609, now seen corresponding path program 1 times [2024-11-08 23:40:34,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:34,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957692943] [2024-11-08 23:40:34,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:34,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957692943] [2024-11-08 23:40:34,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957692943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:34,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:34,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:40:34,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512552742] [2024-11-08 23:40:34,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:34,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:40:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:34,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:40:34,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:40:34,665 INFO L87 Difference]: Start difference. First operand has 80 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-11-08 23:40:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:34,692 INFO L93 Difference]: Finished difference Result 157 states and 253 transitions. [2024-11-08 23:40:34,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:40:34,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 110 [2024-11-08 23:40:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:34,702 INFO L225 Difference]: With dead ends: 157 [2024-11-08 23:40:34,702 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 23:40:34,705 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-11-08 23:40:34,708 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:34,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:40:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 23:40:34,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-08 23:40:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 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-11-08 23:40:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 113 transitions. [2024-11-08 23:40:34,758 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 113 transitions. Word has length 110 [2024-11-08 23:40:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:34,758 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 113 transitions. [2024-11-08 23:40:34,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-11-08 23:40:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 113 transitions. [2024-11-08 23:40:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:40:34,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:34,763 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-11-08 23:40:34,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:40:34,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:34,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:34,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1167762185, now seen corresponding path program 1 times [2024-11-08 23:40:34,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:34,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067298836] [2024-11-08 23:40:34,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:34,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:35,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:35,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067298836] [2024-11-08 23:40:35,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067298836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:35,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:35,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:40:35,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351468252] [2024-11-08 23:40:35,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:35,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:40:35,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:35,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:40:35,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:40:35,261 INFO L87 Difference]: Start difference. First operand 76 states and 113 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-11-08 23:40:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:35,429 INFO L93 Difference]: Finished difference Result 259 states and 387 transitions. [2024-11-08 23:40:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:40:35,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-11-08 23:40:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:35,433 INFO L225 Difference]: With dead ends: 259 [2024-11-08 23:40:35,433 INFO L226 Difference]: Without dead ends: 186 [2024-11-08 23:40:35,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:40:35,435 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 144 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:35,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 370 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:40:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-08 23:40:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 147. [2024-11-08 23:40:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 112 states have internal predecessors, (157), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 23:40:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2024-11-08 23:40:35,484 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 110 [2024-11-08 23:40:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:35,485 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2024-11-08 23:40:35,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-11-08 23:40:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2024-11-08 23:40:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:40:35,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:35,493 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-11-08 23:40:35,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:40:35,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:35,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash -420585717, now seen corresponding path program 1 times [2024-11-08 23:40:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:35,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074199589] [2024-11-08 23:40:35,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:35,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:35,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074199589] [2024-11-08 23:40:35,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074199589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:35,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:35,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:40:35,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962511327] [2024-11-08 23:40:35,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:35,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:40:35,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:35,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:40:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:40:35,850 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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-11-08 23:40:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:36,017 INFO L93 Difference]: Finished difference Result 412 states and 622 transitions. [2024-11-08 23:40:36,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:40:36,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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-11-08 23:40:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:36,020 INFO L225 Difference]: With dead ends: 412 [2024-11-08 23:40:36,021 INFO L226 Difference]: Without dead ends: 268 [2024-11-08 23:40:36,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:40:36,023 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 126 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:36,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 409 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:40:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-08 23:40:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 194. [2024-11-08 23:40:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 142 states have (on average 1.3873239436619718) internal successors, (197), 142 states have internal predecessors, (197), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 23:40:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 293 transitions. [2024-11-08 23:40:36,048 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 293 transitions. Word has length 110 [2024-11-08 23:40:36,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:36,049 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 293 transitions. [2024-11-08 23:40:36,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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-11-08 23:40:36,049 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 293 transitions. [2024-11-08 23:40:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:40:36,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:36,051 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-11-08 23:40:36,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:40:36,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:36,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:36,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2134140234, now seen corresponding path program 1 times [2024-11-08 23:40:36,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:36,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405796244] [2024-11-08 23:40:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:36,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405796244] [2024-11-08 23:40:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405796244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:36,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:40:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543363601] [2024-11-08 23:40:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:36,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:40:36,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:36,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:40:36,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:40:36,244 INFO L87 Difference]: Start difference. First operand 194 states and 293 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-11-08 23:40:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:36,298 INFO L93 Difference]: Finished difference Result 407 states and 617 transitions. [2024-11-08 23:40:36,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:40:36,298 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-11-08 23:40:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:36,304 INFO L225 Difference]: With dead ends: 407 [2024-11-08 23:40:36,304 INFO L226 Difference]: Without dead ends: 263 [2024-11-08 23:40:36,305 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-11-08 23:40:36,309 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 74 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:36,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 205 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:40:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-08 23:40:36,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2024-11-08 23:40:36,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 192 states have (on average 1.375) internal successors, (264), 192 states have internal predecessors, (264), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 23:40:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 392 transitions. [2024-11-08 23:40:36,354 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 392 transitions. Word has length 111 [2024-11-08 23:40:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:36,354 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 392 transitions. [2024-11-08 23:40:36,355 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-11-08 23:40:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 392 transitions. [2024-11-08 23:40:36,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:40:36,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:36,356 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-11-08 23:40:36,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:40:36,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:36,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:36,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1006263916, now seen corresponding path program 1 times [2024-11-08 23:40:36,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:36,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798942587] [2024-11-08 23:40:36,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:36,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:37,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:37,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798942587] [2024-11-08 23:40:37,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798942587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:37,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:37,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:40:37,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072190173] [2024-11-08 23:40:37,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:37,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:40:37,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:37,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:40:37,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:40:37,048 INFO L87 Difference]: Start difference. First operand 261 states and 392 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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-11-08 23:40:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:37,467 INFO L93 Difference]: Finished difference Result 575 states and 860 transitions. [2024-11-08 23:40:37,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:40:37,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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-11-08 23:40:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:37,472 INFO L225 Difference]: With dead ends: 575 [2024-11-08 23:40:37,473 INFO L226 Difference]: Without dead ends: 360 [2024-11-08 23:40:37,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:40:37,476 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 184 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:37,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 297 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:40:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-08 23:40:37,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 337. [2024-11-08 23:40:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 268 states have (on average 1.3843283582089552) internal successors, (371), 268 states have internal predecessors, (371), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 23:40:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 499 transitions. [2024-11-08 23:40:37,517 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 499 transitions. Word has length 111 [2024-11-08 23:40:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:37,518 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 499 transitions. [2024-11-08 23:40:37,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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-11-08 23:40:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 499 transitions. [2024-11-08 23:40:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:40:37,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:37,520 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, 1] [2024-11-08 23:40:37,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:40:37,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:37,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:37,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1643132472, now seen corresponding path program 1 times [2024-11-08 23:40:37,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:37,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371678169] [2024-11-08 23:40:37,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:37,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:37,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:37,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371678169] [2024-11-08 23:40:37,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371678169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:37,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:37,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:40:37,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093419424] [2024-11-08 23:40:37,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:37,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:40:37,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:37,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:40:37,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:40:37,729 INFO L87 Difference]: Start difference. First operand 337 states and 499 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-11-08 23:40:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:37,857 INFO L93 Difference]: Finished difference Result 707 states and 1045 transitions. [2024-11-08 23:40:37,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:40:37,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 115 [2024-11-08 23:40:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:37,860 INFO L225 Difference]: With dead ends: 707 [2024-11-08 23:40:37,861 INFO L226 Difference]: Without dead ends: 429 [2024-11-08 23:40:37,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:40:37,862 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 91 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:37,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 406 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:40:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-08 23:40:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 377. [2024-11-08 23:40:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 308 states have (on average 1.3863636363636365) internal successors, (427), 308 states have internal predecessors, (427), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 23:40:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 555 transitions. [2024-11-08 23:40:37,886 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 555 transitions. Word has length 115 [2024-11-08 23:40:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:37,886 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 555 transitions. [2024-11-08 23:40:37,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-11-08 23:40:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 555 transitions. [2024-11-08 23:40:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:40:37,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:37,888 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, 1, 1] [2024-11-08 23:40:37,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:40:37,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:37,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1061639538, now seen corresponding path program 1 times [2024-11-08 23:40:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:37,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135865497] [2024-11-08 23:40:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:39,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:39,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135865497] [2024-11-08 23:40:39,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135865497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:39,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:39,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:40:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154936567] [2024-11-08 23:40:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:39,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:40:39,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:39,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:40:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:40:39,406 INFO L87 Difference]: Start difference. First operand 377 states and 555 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-11-08 23:40:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:41,313 INFO L93 Difference]: Finished difference Result 846 states and 1240 transitions. [2024-11-08 23:40:41,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:40:41,314 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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 116 [2024-11-08 23:40:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:41,318 INFO L225 Difference]: With dead ends: 846 [2024-11-08 23:40:41,318 INFO L226 Difference]: Without dead ends: 568 [2024-11-08 23:40:41,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:40:41,320 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 54 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:41,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 659 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 23:40:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-08 23:40:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 479. [2024-11-08 23:40:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 410 states have (on average 1.3878048780487804) internal successors, (569), 410 states have internal predecessors, (569), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 23:40:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 697 transitions. [2024-11-08 23:40:41,351 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 697 transitions. Word has length 116 [2024-11-08 23:40:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:41,352 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 697 transitions. [2024-11-08 23:40:41,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-11-08 23:40:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 697 transitions. [2024-11-08 23:40:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 23:40:41,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:41,355 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, 1, 1] [2024-11-08 23:40:41,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:40:41,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:41,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:41,357 INFO L85 PathProgramCache]: Analyzing trace with hash 50522288, now seen corresponding path program 1 times [2024-11-08 23:40:41,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:41,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997318664] [2024-11-08 23:40:41,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:41,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:42,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:42,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997318664] [2024-11-08 23:40:42,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997318664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:42,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:42,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:40:42,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574673545] [2024-11-08 23:40:42,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:42,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:40:42,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:42,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:40:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:40:42,805 INFO L87 Difference]: Start difference. First operand 479 states and 697 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-11-08 23:40:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:45,274 INFO L93 Difference]: Finished difference Result 1004 states and 1454 transitions. [2024-11-08 23:40:45,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:40:45,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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 116 [2024-11-08 23:40:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:45,280 INFO L225 Difference]: With dead ends: 1004 [2024-11-08 23:40:45,280 INFO L226 Difference]: Without dead ends: 652 [2024-11-08 23:40:45,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:40:45,283 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 54 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:45,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 807 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 23:40:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-08 23:40:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 479. [2024-11-08 23:40:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 410 states have (on average 1.3878048780487804) internal successors, (569), 410 states have internal predecessors, (569), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 23:40:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 697 transitions. [2024-11-08 23:40:45,315 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 697 transitions. Word has length 116 [2024-11-08 23:40:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:45,315 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 697 transitions. [2024-11-08 23:40:45,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-11-08 23:40:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 697 transitions. [2024-11-08 23:40:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:40:45,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:45,317 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, 1, 1, 1] [2024-11-08 23:40:45,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 23:40:45,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:45,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:45,318 INFO L85 PathProgramCache]: Analyzing trace with hash -865656989, now seen corresponding path program 1 times [2024-11-08 23:40:45,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:45,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401007186] [2024-11-08 23:40:45,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:45,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:45,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:45,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401007186] [2024-11-08 23:40:45,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401007186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:45,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:45,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:40:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526871286] [2024-11-08 23:40:45,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:45,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:40:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:45,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:40:45,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:40:45,585 INFO L87 Difference]: Start difference. First operand 479 states and 697 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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-11-08 23:40:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:45,904 INFO L93 Difference]: Finished difference Result 1015 states and 1464 transitions. [2024-11-08 23:40:45,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:40:45,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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 117 [2024-11-08 23:40:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:45,908 INFO L225 Difference]: With dead ends: 1015 [2024-11-08 23:40:45,909 INFO L226 Difference]: Without dead ends: 663 [2024-11-08 23:40:45,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-08 23:40:45,912 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 174 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:45,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 618 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:40:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-08 23:40:45,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 515. [2024-11-08 23:40:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 446 states have (on average 1.383408071748879) internal successors, (617), 446 states have internal predecessors, (617), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 23:40:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 745 transitions. [2024-11-08 23:40:45,937 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 745 transitions. Word has length 117 [2024-11-08 23:40:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:45,938 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 745 transitions. [2024-11-08 23:40:45,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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-11-08 23:40:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 745 transitions. [2024-11-08 23:40:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:40:45,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:45,939 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, 1, 1, 1] [2024-11-08 23:40:45,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 23:40:45,940 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:45,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash 451141760, now seen corresponding path program 1 times [2024-11-08 23:40:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:45,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450016756] [2024-11-08 23:40:45,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:46,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:46,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450016756] [2024-11-08 23:40:46,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450016756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:46,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:46,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:40:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354472172] [2024-11-08 23:40:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:46,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:40:46,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:46,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:40:46,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:40:46,193 INFO L87 Difference]: Start difference. First operand 515 states and 745 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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-11-08 23:40:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:46,505 INFO L93 Difference]: Finished difference Result 1073 states and 1548 transitions. [2024-11-08 23:40:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:40:46,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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 117 [2024-11-08 23:40:46,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:46,510 INFO L225 Difference]: With dead ends: 1073 [2024-11-08 23:40:46,510 INFO L226 Difference]: Without dead ends: 721 [2024-11-08 23:40:46,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-08 23:40:46,512 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 176 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:46,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 924 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:40:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-08 23:40:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 637. [2024-11-08 23:40:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 550 states have (on average 1.3690909090909091) internal successors, (753), 552 states have internal predecessors, (753), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-08 23:40:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 913 transitions. [2024-11-08 23:40:46,553 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 913 transitions. Word has length 117 [2024-11-08 23:40:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:46,554 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 913 transitions. [2024-11-08 23:40:46,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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-11-08 23:40:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 913 transitions. [2024-11-08 23:40:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:40:46,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:46,556 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, 1, 1, 1, 1] [2024-11-08 23:40:46,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 23:40:46,556 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:46,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash -897430230, now seen corresponding path program 1 times [2024-11-08 23:40:46,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:46,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308970983] [2024-11-08 23:40:46,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:46,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:46,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308970983] [2024-11-08 23:40:46,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308970983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:46,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:46,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:40:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79547545] [2024-11-08 23:40:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:46,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:40:46,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:46,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:40:46,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:40:46,686 INFO L87 Difference]: Start difference. First operand 637 states and 913 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-08 23:40:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:46,769 INFO L93 Difference]: Finished difference Result 1363 states and 1949 transitions. [2024-11-08 23:40:46,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:40:46,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 118 [2024-11-08 23:40:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:46,780 INFO L225 Difference]: With dead ends: 1363 [2024-11-08 23:40:46,781 INFO L226 Difference]: Without dead ends: 905 [2024-11-08 23:40:46,782 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-11-08 23:40:46,783 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 52 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:46,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 205 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:40:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-08 23:40:46,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 900. [2024-11-08 23:40:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 795 states have (on average 1.3534591194968553) internal successors, (1076), 800 states have internal predecessors, (1076), 92 states have call successors, (92), 12 states have call predecessors, (92), 12 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-08 23:40:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1260 transitions. [2024-11-08 23:40:46,832 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1260 transitions. Word has length 118 [2024-11-08 23:40:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:46,833 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1260 transitions. [2024-11-08 23:40:46,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-08 23:40:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1260 transitions. [2024-11-08 23:40:46,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:40:46,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:46,835 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, 1, 1, 1, 1] [2024-11-08 23:40:46,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 23:40:46,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:46,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash -623766099, now seen corresponding path program 1 times [2024-11-08 23:40:46,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:46,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38674647] [2024-11-08 23:40:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:47,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:47,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38674647] [2024-11-08 23:40:47,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38674647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:47,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:47,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:40:47,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068799655] [2024-11-08 23:40:47,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:47,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:40:47,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:47,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:40:47,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:40:47,277 INFO L87 Difference]: Start difference. First operand 900 states and 1260 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-11-08 23:40:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:47,522 INFO L93 Difference]: Finished difference Result 1219 states and 1695 transitions. [2024-11-08 23:40:47,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 23:40:47,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 118 [2024-11-08 23:40:47,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:47,529 INFO L225 Difference]: With dead ends: 1219 [2024-11-08 23:40:47,530 INFO L226 Difference]: Without dead ends: 1217 [2024-11-08 23:40:47,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:40:47,531 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 66 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:47,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 742 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:40:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-08 23:40:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1213. [2024-11-08 23:40:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1062 states have (on average 1.3389830508474576) internal successors, (1422), 1072 states have internal predecessors, (1422), 132 states have call successors, (132), 18 states have call predecessors, (132), 18 states have return successors, (132), 122 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-08 23:40:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1686 transitions. [2024-11-08 23:40:47,601 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1686 transitions. Word has length 118 [2024-11-08 23:40:47,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:47,602 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1686 transitions. [2024-11-08 23:40:47,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-11-08 23:40:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1686 transitions. [2024-11-08 23:40:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:40:47,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:47,604 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, 1, 1, 1, 1] [2024-11-08 23:40:47,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 23:40:47,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:47,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:47,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1683748373, now seen corresponding path program 1 times [2024-11-08 23:40:47,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:47,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097453595] [2024-11-08 23:40:47,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:47,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:48,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:48,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097453595] [2024-11-08 23:40:48,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097453595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:48,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:48,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:40:48,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632627734] [2024-11-08 23:40:48,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:48,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:40:48,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:48,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:40:48,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:40:48,277 INFO L87 Difference]: Start difference. First operand 1213 states and 1686 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-11-08 23:40:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:49,743 INFO L93 Difference]: Finished difference Result 2734 states and 3768 transitions. [2024-11-08 23:40:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 23:40:49,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 118 [2024-11-08 23:40:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:49,753 INFO L225 Difference]: With dead ends: 2734 [2024-11-08 23:40:49,753 INFO L226 Difference]: Without dead ends: 1842 [2024-11-08 23:40:49,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:40:49,757 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 40 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:49,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 714 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 23:40:49,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2024-11-08 23:40:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1827. [2024-11-08 23:40:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1637 states have (on average 1.3121563836285888) internal successors, (2148), 1660 states have internal predecessors, (2148), 158 states have call successors, (158), 31 states have call predecessors, (158), 31 states have return successors, (158), 135 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-08 23:40:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2464 transitions. [2024-11-08 23:40:49,931 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2464 transitions. Word has length 118 [2024-11-08 23:40:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:49,931 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2464 transitions. [2024-11-08 23:40:49,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-11-08 23:40:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2464 transitions. [2024-11-08 23:40:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:40:49,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:49,934 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, 1, 1, 1, 1] [2024-11-08 23:40:49,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 23:40:49,935 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:49,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash 403884695, now seen corresponding path program 1 times [2024-11-08 23:40:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:49,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559774868] [2024-11-08 23:40:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:49,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:50,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559774868] [2024-11-08 23:40:50,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559774868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:50,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:50,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:40:50,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826342409] [2024-11-08 23:40:50,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:50,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:40:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:50,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:40:50,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:40:50,840 INFO L87 Difference]: Start difference. First operand 1827 states and 2464 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-11-08 23:40:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:52,085 INFO L93 Difference]: Finished difference Result 3791 states and 5150 transitions. [2024-11-08 23:40:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 23:40:52,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 118 [2024-11-08 23:40:52,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:52,099 INFO L225 Difference]: With dead ends: 3791 [2024-11-08 23:40:52,099 INFO L226 Difference]: Without dead ends: 2453 [2024-11-08 23:40:52,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:40:52,104 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 65 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:52,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 843 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 23:40:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2024-11-08 23:40:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2188. [2024-11-08 23:40:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2188 states, 1971 states have (on average 1.308980213089802) internal successors, (2580), 1995 states have internal predecessors, (2580), 180 states have call successors, (180), 36 states have call predecessors, (180), 36 states have return successors, (180), 156 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-08 23:40:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 2940 transitions. [2024-11-08 23:40:52,318 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 2940 transitions. Word has length 118 [2024-11-08 23:40:52,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:52,318 INFO L471 AbstractCegarLoop]: Abstraction has 2188 states and 2940 transitions. [2024-11-08 23:40:52,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-11-08 23:40:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 2940 transitions. [2024-11-08 23:40:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:40:52,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:52,322 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, 1, 1, 1, 1] [2024-11-08 23:40:52,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 23:40:52,322 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:52,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1066732043, now seen corresponding path program 1 times [2024-11-08 23:40:52,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:52,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957059273] [2024-11-08 23:40:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:52,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957059273] [2024-11-08 23:40:52,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957059273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:52,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:52,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:40:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997113588] [2024-11-08 23:40:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:52,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:40:52,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:52,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:40:52,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:40:52,533 INFO L87 Difference]: Start difference. First operand 2188 states and 2940 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-11-08 23:40:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:52,903 INFO L93 Difference]: Finished difference Result 4316 states and 5846 transitions. [2024-11-08 23:40:52,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 23:40:52,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 118 [2024-11-08 23:40:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:52,916 INFO L225 Difference]: With dead ends: 4316 [2024-11-08 23:40:52,916 INFO L226 Difference]: Without dead ends: 2760 [2024-11-08 23:40:52,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:40:52,922 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 62 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:52,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 533 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:40:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2024-11-08 23:40:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2616. [2024-11-08 23:40:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2616 states, 2353 states have (on average 1.301742456438589) internal successors, (3063), 2386 states have internal predecessors, (3063), 214 states have call successors, (214), 48 states have call predecessors, (214), 48 states have return successors, (214), 181 states have call predecessors, (214), 214 states have call successors, (214) [2024-11-08 23:40:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 3491 transitions. [2024-11-08 23:40:53,183 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 3491 transitions. Word has length 118 [2024-11-08 23:40:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:53,184 INFO L471 AbstractCegarLoop]: Abstraction has 2616 states and 3491 transitions. [2024-11-08 23:40:53,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-11-08 23:40:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 3491 transitions. [2024-11-08 23:40:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 23:40:53,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:53,188 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, 1, 1, 1, 1] [2024-11-08 23:40:53,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 23:40:53,189 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:53,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:53,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1763361149, now seen corresponding path program 1 times [2024-11-08 23:40:53,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:53,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441960176] [2024-11-08 23:40:53,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:53,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:53,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:53,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441960176] [2024-11-08 23:40:53,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441960176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:53,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:53,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:40:53,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5093787] [2024-11-08 23:40:53,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:53,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:40:53,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:53,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:40:53,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:40:53,288 INFO L87 Difference]: Start difference. First operand 2616 states and 3491 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-08 23:40:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:53,555 INFO L93 Difference]: Finished difference Result 4479 states and 6009 transitions. [2024-11-08 23:40:53,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:40:53,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 118 [2024-11-08 23:40:53,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:53,567 INFO L225 Difference]: With dead ends: 4479 [2024-11-08 23:40:53,567 INFO L226 Difference]: Without dead ends: 2348 [2024-11-08 23:40:53,572 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-11-08 23:40:53,572 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 51 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:53,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 261 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:40:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2024-11-08 23:40:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2134. [2024-11-08 23:40:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2134 states, 1910 states have (on average 1.2670157068062826) internal successors, (2420), 1932 states have internal predecessors, (2420), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-08 23:40:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 2780 transitions. [2024-11-08 23:40:53,775 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 2780 transitions. Word has length 118 [2024-11-08 23:40:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:53,775 INFO L471 AbstractCegarLoop]: Abstraction has 2134 states and 2780 transitions. [2024-11-08 23:40:53,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-08 23:40:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 2780 transitions. [2024-11-08 23:40:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 23:40:53,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:53,778 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, 1, 1, 1, 1, 1] [2024-11-08 23:40:53,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 23:40:53,779 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:53,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2121655875, now seen corresponding path program 1 times [2024-11-08 23:40:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:53,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609002747] [2024-11-08 23:40:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,176 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:54,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:54,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609002747] [2024-11-08 23:40:54,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609002747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:54,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:54,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:40:54,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455672398] [2024-11-08 23:40:54,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:54,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:40:54,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:54,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:40:54,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:40:54,179 INFO L87 Difference]: Start difference. First operand 2134 states and 2780 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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-11-08 23:40:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:54,722 INFO L93 Difference]: Finished difference Result 4213 states and 5524 transitions. [2024-11-08 23:40:54,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:40:54,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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 119 [2024-11-08 23:40:54,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:54,732 INFO L225 Difference]: With dead ends: 4213 [2024-11-08 23:40:54,733 INFO L226 Difference]: Without dead ends: 2465 [2024-11-08 23:40:54,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:40:54,737 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 132 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:54,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 775 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:40:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2024-11-08 23:40:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2121. [2024-11-08 23:40:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1897 states have (on average 1.2630469161834474) internal successors, (2396), 1919 states have internal predecessors, (2396), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-08 23:40:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2756 transitions. [2024-11-08 23:40:54,926 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2756 transitions. Word has length 119 [2024-11-08 23:40:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:54,927 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2756 transitions. [2024-11-08 23:40:54,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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-11-08 23:40:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2756 transitions. [2024-11-08 23:40:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 23:40:54,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:54,930 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, 1, 1, 1, 1, 1] [2024-11-08 23:40:54,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 23:40:54,930 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:54,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:54,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1874300736, now seen corresponding path program 1 times [2024-11-08 23:40:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772365857] [2024-11-08 23:40:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,576 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:55,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:55,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772365857] [2024-11-08 23:40:55,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772365857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:55,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:55,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:40:55,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729317214] [2024-11-08 23:40:55,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:55,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 23:40:55,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:55,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 23:40:55,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:40:55,579 INFO L87 Difference]: Start difference. First operand 2121 states and 2756 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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-11-08 23:40:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:56,401 INFO L93 Difference]: Finished difference Result 4163 states and 5452 transitions. [2024-11-08 23:40:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 23:40:56,402 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 119 [2024-11-08 23:40:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:56,414 INFO L225 Difference]: With dead ends: 4163 [2024-11-08 23:40:56,414 INFO L226 Difference]: Without dead ends: 2514 [2024-11-08 23:40:56,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-08 23:40:56,419 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 190 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:56,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 645 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:40:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2024-11-08 23:40:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2131. [2024-11-08 23:40:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 1907 states have (on average 1.2616675406397484) internal successors, (2406), 1929 states have internal predecessors, (2406), 180 states have call successors, (180), 43 states have call predecessors, (180), 43 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-08 23:40:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2766 transitions. [2024-11-08 23:40:56,643 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2766 transitions. Word has length 119 [2024-11-08 23:40:56,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:56,643 INFO L471 AbstractCegarLoop]: Abstraction has 2131 states and 2766 transitions. [2024-11-08 23:40:56,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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-11-08 23:40:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2766 transitions. [2024-11-08 23:40:56,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 23:40:56,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:56,646 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, 1, 1, 1, 1, 1] [2024-11-08 23:40:56,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 23:40:56,646 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:56,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:56,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1002246576, now seen corresponding path program 1 times [2024-11-08 23:40:56,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:56,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190870667] [2024-11-08 23:40:56,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:56,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:40:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:40:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:40:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:40:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:40:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:40:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:40:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:40:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:40:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:40:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:40:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-11-08 23:40:56,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:56,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190870667] [2024-11-08 23:40:56,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190870667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:40:56,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85152739] [2024-11-08 23:40:56,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:56,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:40:56,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:40:56,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:40:56,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:40:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:56,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 23:40:56,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:40:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 194 proven. 9 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-11-08 23:40:57,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:40:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 12 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-11-08 23:40:57,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85152739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:40:57,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:40:57,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2024-11-08 23:40:57,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313311694] [2024-11-08 23:40:57,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:40:57,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:40:57,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:57,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:40:57,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:40:57,392 INFO L87 Difference]: Start difference. First operand 2131 states and 2766 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 23:40:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:57,881 INFO L93 Difference]: Finished difference Result 4333 states and 5580 transitions. [2024-11-08 23:40:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 23:40:57,881 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 119 [2024-11-08 23:40:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:57,891 INFO L225 Difference]: With dead ends: 4333 [2024-11-08 23:40:57,891 INFO L226 Difference]: Without dead ends: 2247 [2024-11-08 23:40:57,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 262 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2024-11-08 23:40:57,897 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 224 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:57,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 317 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:40:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2024-11-08 23:40:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2163. [2024-11-08 23:40:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1931 states have (on average 1.2459865354738477) internal successors, (2406), 1953 states have internal predecessors, (2406), 180 states have call successors, (180), 51 states have call predecessors, (180), 51 states have return successors, (180), 158 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-08 23:40:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2766 transitions. [2024-11-08 23:40:58,124 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2766 transitions. Word has length 119 [2024-11-08 23:40:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:58,125 INFO L471 AbstractCegarLoop]: Abstraction has 2163 states and 2766 transitions. [2024-11-08 23:40:58,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 23:40:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2766 transitions. [2024-11-08 23:40:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:40:58,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:58,132 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, 1, 1, 1, 1, 1, 1] [2024-11-08 23:40:58,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:40:58,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:40:58,334 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:58,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash -37171109, now seen corresponding path program 1 times [2024-11-08 23:40:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:58,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274055101] [2024-11-08 23:40:58,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:40:58,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1347143755] [2024-11-08 23:40:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:58,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:40:58,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:40:58,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:40:58,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:40:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:40:58,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:40:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:40:58,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:40:58,658 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:40:58,659 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:40:58,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:40:58,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-08 23:40:58,866 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:40:58,950 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:40:58,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:40:58 BoogieIcfgContainer [2024-11-08 23:40:58,953 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:40:58,954 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:40:58,954 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:40:58,954 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:40:58,955 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:40:34" (3/4) ... [2024-11-08 23:40:58,956 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:40:58,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:40:58,958 INFO L158 Benchmark]: Toolchain (without parser) took 25950.08ms. Allocated memory was 157.3MB in the beginning and 488.6MB in the end (delta: 331.4MB). Free memory was 121.3MB in the beginning and 345.6MB in the end (delta: -224.3MB). Peak memory consumption was 108.4MB. Max. memory is 16.1GB. [2024-11-08 23:40:58,958 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 157.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:40:58,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.09ms. Allocated memory is still 157.3MB. Free memory was 121.3MB in the beginning and 106.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:40:58,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.42ms. Allocated memory is still 157.3MB. Free memory was 106.2MB in the beginning and 102.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:40:58,959 INFO L158 Benchmark]: Boogie Preprocessor took 77.81ms. Allocated memory is still 157.3MB. Free memory was 102.6MB in the beginning and 97.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:40:58,959 INFO L158 Benchmark]: RCFGBuilder took 574.81ms. Allocated memory is still 157.3MB. Free memory was 97.4MB in the beginning and 72.7MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 23:40:58,959 INFO L158 Benchmark]: TraceAbstraction took 24907.17ms. Allocated memory was 157.3MB in the beginning and 488.6MB in the end (delta: 331.4MB). Free memory was 71.7MB in the beginning and 345.6MB in the end (delta: -273.9MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-11-08 23:40:58,959 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 488.6MB. Free memory is still 345.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:40:58,960 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.50ms. Allocated memory is still 157.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.09ms. Allocated memory is still 157.3MB. Free memory was 121.3MB in the beginning and 106.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.42ms. Allocated memory is still 157.3MB. Free memory was 106.2MB in the beginning and 102.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.81ms. Allocated memory is still 157.3MB. Free memory was 102.6MB in the beginning and 97.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 574.81ms. Allocated memory is still 157.3MB. Free memory was 97.4MB in the beginning and 72.7MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 24907.17ms. Allocated memory was 157.3MB in the beginning and 488.6MB in the end (delta: 331.4MB). Free memory was 71.7MB in the beginning and 345.6MB in the end (delta: -273.9MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 488.6MB. Free memory is still 345.6MB. 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 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_3 = 128; [L24] unsigned short int var_1_4 = 4; [L25] unsigned short int var_1_5 = 0; [L26] signed short int var_1_6 = 0; [L27] unsigned char var_1_7 = 1; [L28] signed short int var_1_8 = -2; [L29] signed short int var_1_9 = 500; [L30] unsigned long int var_1_10 = 10; [L31] unsigned char var_1_11 = 2; [L32] unsigned char var_1_12 = 64; [L33] unsigned long int var_1_13 = 1; [L34] unsigned long int last_1_var_1_10 = 10; [L35] unsigned long int last_1_var_1_13 = 1; VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L97] COND TRUE k_loop < 1 [L98] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L63] var_1_4 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L64] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L66] var_1_5 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L69] var_1_7 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L71] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L71] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L73] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L76] RET assume_abort_if_not(var_1_9 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L80] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L83] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L99] RET updateVariables() [L100] CALL step() [L39] COND FALSE !(last_1_var_1_13 >= -50) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L42] EXPR var_1_11 & var_1_12 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L42] signed long int stepLocal_0 = var_1_11 & var_1_12; [L43] COND TRUE \read(var_1_7) [L44] var_1_13 = ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L50] COND TRUE \read(var_1_7) [L51] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] COND TRUE (var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5)) [L54] var_1_10 = ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L100] RET step() [L101] CALL, EXPR property() [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90-L91] return ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.8s, OverallIterations: 20, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1972 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1959 mSDsluCounter, 9847 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7546 mSDsCounter, 429 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2654 IncrementalHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 429 mSolverCounterUnsat, 2301 mSDtfsCounter, 2654 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1045 GetRequests, 899 SyntacticMatches, 2 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2616occurred in iteration=15, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 2142 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 2557 NumberOfCodeBlocks, 2557 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2415 ConstructedInterpolants, 0 QuantifiedInterpolants, 9561 SizeOfPredicates, 1 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 21 InterpolantComputations, 18 PerfectInterpolantSequences, 10050/10080 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-11-08 23:40:59,022 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.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 d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:41:01,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:41:01,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:41:01,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:41:01,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:41:01,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:41:01,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:41:01,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:41:01,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:41:01,352 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:41:01,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:41:01,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:41:01,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:41:01,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:41:01,355 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:41:01,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:41:01,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:41:01,359 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:41:01,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:41:01,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:41:01,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:41:01,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:41:01,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:41:01,360 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:41:01,361 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:41:01,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:41:01,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:41:01,362 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:41:01,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:41:01,363 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:41:01,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:41:01,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:41:01,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:41:01,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:41:01,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:41:01,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:41:01,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:41:01,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:41:01,368 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:41:01,368 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:41:01,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:41:01,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:41:01,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:41:01,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:41:01,369 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 -> d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 [2024-11-08 23:41:01,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:41:01,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:41:01,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:41:01,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:41:01,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:41:01,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-11-08 23:41:03,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:41:03,519 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:41:03,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-11-08 23:41:03,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ec6f191/95e643d054fa45fbb173923c3ca4fe57/FLAGc6e23acff [2024-11-08 23:41:03,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ec6f191/95e643d054fa45fbb173923c3ca4fe57 [2024-11-08 23:41:03,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:41:03,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:41:03,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:41:03,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:41:03,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:41:03,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:03,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70be44be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03, skipping insertion in model container [2024-11-08 23:41:03,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:03,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:41:03,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2024-11-08 23:41:03,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:41:03,858 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:41:03,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2024-11-08 23:41:03,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:41:03,914 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:41:03,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03 WrapperNode [2024-11-08 23:41:03,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:41:03,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:41:03,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:41:03,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:41:03,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:03,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:03,972 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-08 23:41:03,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:41:03,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:41:03,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:41:03,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:41:03,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:03,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:03,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:04,008 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:41:04,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:04,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:04,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:04,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:04,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:04,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:04,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:41:04,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:41:04,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:41:04,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:41:04,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (1/1) ... [2024-11-08 23:41:04,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:41:04,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:41:04,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:41:04,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:41:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:41:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:41:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:41:04,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:41:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:41:04,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:41:04,235 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:41:04,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:41:04,562 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 23:41:04,562 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:41:04,581 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:41:04,581 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:41:04,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:41:04 BoogieIcfgContainer [2024-11-08 23:41:04,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:41:04,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:41:04,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:41:04,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:41:04,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:41:03" (1/3) ... [2024-11-08 23:41:04,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45870da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:41:04, skipping insertion in model container [2024-11-08 23:41:04,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:41:03" (2/3) ... [2024-11-08 23:41:04,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45870da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:41:04, skipping insertion in model container [2024-11-08 23:41:04,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:41:04" (3/3) ... [2024-11-08 23:41:04,592 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-11-08 23:41:04,609 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:41:04,610 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:41:04,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:41:04,690 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;@3d6e688, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:41:04,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:41:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 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-11-08 23:41:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:41:04,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:04,709 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] [2024-11-08 23:41:04,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:04,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:04,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2139628185, now seen corresponding path program 1 times [2024-11-08 23:41:04,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:41:04,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673708305] [2024-11-08 23:41:04,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:04,734 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-11-08 23:41:04,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:41:04,738 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-11-08 23:41:04,739 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-11-08 23:41:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:04,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:41:04,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:41:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-08 23:41:04,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:41:04,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:41:04,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673708305] [2024-11-08 23:41:04,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673708305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:04,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:04,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:41:04,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375756611] [2024-11-08 23:41:04,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:04,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:41:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:41:04,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:41:04,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:41:05,001 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:41:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:05,031 INFO L93 Difference]: Finished difference Result 97 states and 159 transitions. [2024-11-08 23:41:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:41:05,034 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-11-08 23:41:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:05,043 INFO L225 Difference]: With dead ends: 97 [2024-11-08 23:41:05,043 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 23:41:05,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:41:05,051 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:05,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:41:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 23:41:05,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 23:41:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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-11-08 23:41:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-08 23:41:05,093 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 102 [2024-11-08 23:41:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:05,093 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-08 23:41:05,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:41:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-08 23:41:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:41:05,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:05,097 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] [2024-11-08 23:41:05,103 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-11-08 23:41:05,299 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-11-08 23:41:05,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:05,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1083096423, now seen corresponding path program 1 times [2024-11-08 23:41:05,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:41:05,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350831881] [2024-11-08 23:41:05,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:05,302 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-11-08 23:41:05,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:41:05,303 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-11-08 23:41:05,304 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-11-08 23:41:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:05,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:41:05,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:41:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:41:05,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:41:05,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:41:05,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350831881] [2024-11-08 23:41:05,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350831881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:41:05,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:41:05,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:41:05,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324986889] [2024-11-08 23:41:05,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:41:05,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:41:05,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:41:05,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:41:05,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:41:05,872 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-11-08 23:41:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:41:06,070 INFO L93 Difference]: Finished difference Result 142 states and 204 transitions. [2024-11-08 23:41:06,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:41:06,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 102 [2024-11-08 23:41:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:41:06,077 INFO L225 Difference]: With dead ends: 142 [2024-11-08 23:41:06,077 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 23:41:06,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:41:06,079 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 47 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:41:06,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 191 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:41:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 23:41:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2024-11-08 23:41:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 23:41:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2024-11-08 23:41:06,114 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 102 [2024-11-08 23:41:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:41:06,116 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2024-11-08 23:41:06,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-11-08 23:41:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2024-11-08 23:41:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:41:06,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:41:06,120 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] [2024-11-08 23:41:06,128 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 (3)] Ended with exit code 0 [2024-11-08 23:41:06,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-11-08 23:41:06,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:41:06,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:41:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1763154793, now seen corresponding path program 1 times [2024-11-08 23:41:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:41:06,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093717886] [2024-11-08 23:41:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:41:06,327 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-11-08 23:41:06,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:41:06,330 INFO L229 MonitoredProcess]: Starting monitored process 4 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-11-08 23:41:06,332 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 (4)] Waiting until timeout for monitored process [2024-11-08 23:41:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:41:06,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 23:41:06,456 INFO L278 TraceCheckSpWp]: Computing forward predicates...