./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_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 b3713b25a83a921fe666aac85c13dc353e68d0c4544ef354673bb4c8722689bd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:44:02,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:44:02,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:44:02,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:44:02,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:44:02,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:44:02,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:44:02,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:44:02,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:44:02,169 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:44:02,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:44:02,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:44:02,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:44:02,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:44:02,173 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:44:02,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:44:02,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:44:02,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:44:02,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:44:02,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:44:02,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:44:02,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:44:02,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:44:02,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:44:02,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:44:02,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:44:02,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:44:02,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:44:02,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:44:02,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:44:02,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:44:02,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:44:02,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:44:02,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:44:02,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:44:02,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:44:02,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:44:02,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:44:02,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:44:02,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:44:02,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:44:02,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:44:02,184 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 -> b3713b25a83a921fe666aac85c13dc353e68d0c4544ef354673bb4c8722689bd [2024-11-20 06:44:02,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:44:02,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:44:02,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:44:02,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:44:02,468 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:44:02,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i [2024-11-20 06:44:03,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:44:04,115 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:44:04,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i [2024-11-20 06:44:04,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d38c27e8/398d724f21df49c59f37c2a03ad97343/FLAG3d10e06a4 [2024-11-20 06:44:04,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d38c27e8/398d724f21df49c59f37c2a03ad97343 [2024-11-20 06:44:04,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:44:04,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:44:04,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:44:04,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:44:04,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:44:04,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:04,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2ae1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04, skipping insertion in model container [2024-11-20 06:44:04,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:04,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:44:04,716 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-while_file-32.i[915,928] [2024-11-20 06:44:04,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:44:04,777 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:44:04,790 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-while_file-32.i[915,928] [2024-11-20 06:44:04,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:44:04,837 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:44:04,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04 WrapperNode [2024-11-20 06:44:04,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:44:04,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:44:04,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:44:04,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:44:04,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:04,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:04,923 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-20 06:44:04,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:44:04,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:44:04,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:44:04,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:44:04,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:04,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:04,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:04,973 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:44:04,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:04,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:04,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:04,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:04,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:05,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:05,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:44:05,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:44:05,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:44:05,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:44:05,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (1/1) ... [2024-11-20 06:44:05,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:44:05,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:44:05,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:44:05,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:44:05,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:44:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:44:05,102 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:44:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:44:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:44:05,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:44:05,183 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:44:05,187 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:44:05,603 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-20 06:44:05,604 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:44:05,621 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:44:05,621 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:44:05,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:44:05 BoogieIcfgContainer [2024-11-20 06:44:05,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:44:05,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:44:05,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:44:05,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:44:05,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:44:04" (1/3) ... [2024-11-20 06:44:05,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e3a34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:44:05, skipping insertion in model container [2024-11-20 06:44:05,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:04" (2/3) ... [2024-11-20 06:44:05,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e3a34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:44:05, skipping insertion in model container [2024-11-20 06:44:05,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:44:05" (3/3) ... [2024-11-20 06:44:05,636 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-32.i [2024-11-20 06:44:05,654 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:44:05,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:44:05,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:44:05,724 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;@45dace2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:44:05,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:44:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 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-20 06:44:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 06:44:05,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:05,739 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-20 06:44:05,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:05,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash -571826580, now seen corresponding path program 1 times [2024-11-20 06:44:05,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:05,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108199077] [2024-11-20 06:44:05,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:05,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:05,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:05,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,121 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-20 06:44:06,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:06,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108199077] [2024-11-20 06:44:06,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108199077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:06,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:06,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:44:06,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101509513] [2024-11-20 06:44:06,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:06,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:44:06,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:06,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:44:06,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:44:06,159 INFO L87 Difference]: Start difference. First operand has 79 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 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-20 06:44:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:06,194 INFO L93 Difference]: Finished difference Result 151 states and 248 transitions. [2024-11-20 06:44:06,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:44:06,198 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-20 06:44:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:06,205 INFO L225 Difference]: With dead ends: 151 [2024-11-20 06:44:06,205 INFO L226 Difference]: Without dead ends: 75 [2024-11-20 06:44:06,208 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-20 06:44:06,211 INFO L432 NwaCegarLoop]: 112 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, 112 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-20 06:44:06,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:44:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-20 06:44:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-20 06:44:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 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-20 06:44:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2024-11-20 06:44:06,320 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 110 [2024-11-20 06:44:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:06,323 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2024-11-20 06:44:06,323 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-20 06:44:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2024-11-20 06:44:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 06:44:06,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:06,334 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-20 06:44:06,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:44:06,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:06,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:06,336 INFO L85 PathProgramCache]: Analyzing trace with hash 153189996, now seen corresponding path program 1 times [2024-11-20 06:44:06,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:06,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624605604] [2024-11-20 06:44:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:06,846 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-20 06:44:06,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:06,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624605604] [2024-11-20 06:44:06,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624605604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:06,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:06,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:44:06,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232249431] [2024-11-20 06:44:06,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:06,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:44:06,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:06,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:44:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:44:06,854 INFO L87 Difference]: Start difference. First operand 75 states and 112 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-20 06:44:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:07,026 INFO L93 Difference]: Finished difference Result 255 states and 383 transitions. [2024-11-20 06:44:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:44:07,027 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-20 06:44:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:07,030 INFO L225 Difference]: With dead ends: 255 [2024-11-20 06:44:07,030 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 06:44:07,031 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-20 06:44:07,032 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 142 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 366 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-20 06:44:07,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 366 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:44:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 06:44:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2024-11-20 06:44:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 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-20 06:44:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 219 transitions. [2024-11-20 06:44:07,070 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 219 transitions. Word has length 110 [2024-11-20 06:44:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:07,071 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 219 transitions. [2024-11-20 06:44:07,071 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-20 06:44:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-20 06:44:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 06:44:07,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:07,074 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-20 06:44:07,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:44:07,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:07,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1435157906, now seen corresponding path program 1 times [2024-11-20 06:44:07,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:07,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332169724] [2024-11-20 06:44:07,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,451 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-20 06:44:07,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:07,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332169724] [2024-11-20 06:44:07,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332169724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:07,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:07,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:44:07,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620702776] [2024-11-20 06:44:07,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:07,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:44:07,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:07,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:44:07,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:44:07,455 INFO L87 Difference]: Start difference. First operand 145 states and 219 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-20 06:44:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:07,662 INFO L93 Difference]: Finished difference Result 406 states and 616 transitions. [2024-11-20 06:44:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:44:07,663 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-20 06:44:07,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:07,667 INFO L225 Difference]: With dead ends: 406 [2024-11-20 06:44:07,669 INFO L226 Difference]: Without dead ends: 264 [2024-11-20 06:44:07,673 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-20 06:44:07,674 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 125 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 405 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.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:07,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 405 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:44:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-20 06:44:07,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 192. [2024-11-20 06:44:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 140 states have internal predecessors, (195), 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-20 06:44:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2024-11-20 06:44:07,702 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 110 [2024-11-20 06:44:07,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:07,703 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2024-11-20 06:44:07,703 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-20 06:44:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2024-11-20 06:44:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 06:44:07,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:07,705 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-20 06:44:07,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:44:07,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:07,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1846945656, now seen corresponding path program 1 times [2024-11-20 06:44:07,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:07,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396785515] [2024-11-20 06:44:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:07,937 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-20 06:44:07,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:07,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396785515] [2024-11-20 06:44:07,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396785515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:07,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:07,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:44:07,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34887148] [2024-11-20 06:44:07,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:07,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:44:07,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:07,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:44:07,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:44:07,942 INFO L87 Difference]: Start difference. First operand 192 states and 291 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-20 06:44:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:07,999 INFO L93 Difference]: Finished difference Result 402 states and 612 transitions. [2024-11-20 06:44:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:44:08,000 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-20 06:44:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:08,006 INFO L225 Difference]: With dead ends: 402 [2024-11-20 06:44:08,006 INFO L226 Difference]: Without dead ends: 260 [2024-11-20 06:44:08,008 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-20 06:44:08,009 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 73 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 203 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-20 06:44:08,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 203 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:44:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-20 06:44:08,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2024-11-20 06:44:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 189 states have (on average 1.380952380952381) internal successors, (261), 189 states have internal predecessors, (261), 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-20 06:44:08,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 389 transitions. [2024-11-20 06:44:08,060 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 389 transitions. Word has length 111 [2024-11-20 06:44:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:08,061 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 389 transitions. [2024-11-20 06:44:08,061 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-20 06:44:08,062 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 389 transitions. [2024-11-20 06:44:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 06:44:08,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:08,065 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-20 06:44:08,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:44:08,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:08,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:08,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1320145322, now seen corresponding path program 1 times [2024-11-20 06:44:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:08,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056754711] [2024-11-20 06:44:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:08,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:08,714 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-20 06:44:08,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:08,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056754711] [2024-11-20 06:44:08,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056754711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:08,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:08,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 06:44:08,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334715008] [2024-11-20 06:44:08,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:08,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 06:44:08,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:08,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 06:44:08,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 06:44:08,716 INFO L87 Difference]: Start difference. First operand 258 states and 389 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-20 06:44:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:08,999 INFO L93 Difference]: Finished difference Result 586 states and 873 transitions. [2024-11-20 06:44:09,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 06:44:09,000 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-20 06:44:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:09,003 INFO L225 Difference]: With dead ends: 586 [2024-11-20 06:44:09,003 INFO L226 Difference]: Without dead ends: 374 [2024-11-20 06:44:09,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:44:09,005 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 132 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:09,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 332 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:44:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-20 06:44:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 334. [2024-11-20 06:44:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 265 states have (on average 1.4) internal successors, (371), 265 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-20 06:44:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 499 transitions. [2024-11-20 06:44:09,028 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 499 transitions. Word has length 111 [2024-11-20 06:44:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:09,029 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 499 transitions. [2024-11-20 06:44:09,029 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-20 06:44:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 499 transitions. [2024-11-20 06:44:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 06:44:09,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:09,031 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:44:09,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:44:09,031 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:09,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash -217033849, now seen corresponding path program 1 times [2024-11-20 06:44:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:09,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783003674] [2024-11-20 06:44:09,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:09,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,538 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-20 06:44:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:09,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783003674] [2024-11-20 06:44:09,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783003674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:09,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:09,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:44:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515119867] [2024-11-20 06:44:09,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:09,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:44:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:09,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:44:09,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:44:09,543 INFO L87 Difference]: Start difference. First operand 334 states and 499 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 06:44:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:09,754 INFO L93 Difference]: Finished difference Result 606 states and 903 transitions. [2024-11-20 06:44:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:44:09,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-20 06:44:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:09,757 INFO L225 Difference]: With dead ends: 606 [2024-11-20 06:44:09,757 INFO L226 Difference]: Without dead ends: 323 [2024-11-20 06:44:09,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 06:44:09,761 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 95 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:09,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 322 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:44:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-20 06:44:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 309. [2024-11-20 06:44:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 240 states have (on average 1.35) internal successors, (324), 240 states have internal predecessors, (324), 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-20 06:44:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 452 transitions. [2024-11-20 06:44:09,790 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 452 transitions. Word has length 112 [2024-11-20 06:44:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:09,791 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 452 transitions. [2024-11-20 06:44:09,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 06:44:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 452 transitions. [2024-11-20 06:44:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 06:44:09,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:09,792 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:44:09,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 06:44:09,793 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:09,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:09,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1780310582, now seen corresponding path program 1 times [2024-11-20 06:44:09,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:09,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310722969] [2024-11-20 06:44:09,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:09,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:09,997 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-20 06:44:09,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:09,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310722969] [2024-11-20 06:44:09,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310722969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:09,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:09,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:44:09,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431396326] [2024-11-20 06:44:09,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:09,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:44:09,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:09,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:44:09,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:44:09,999 INFO L87 Difference]: Start difference. First operand 309 states and 452 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-20 06:44:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:10,140 INFO L93 Difference]: Finished difference Result 636 states and 929 transitions. [2024-11-20 06:44:10,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:44:10,141 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-20 06:44:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:10,144 INFO L225 Difference]: With dead ends: 636 [2024-11-20 06:44:10,144 INFO L226 Difference]: Without dead ends: 382 [2024-11-20 06:44:10,145 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-20 06:44:10,146 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 90 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 402 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-20 06:44:10,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 402 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:44:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-20 06:44:10,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 339. [2024-11-20 06:44:10,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 270 states have (on average 1.3555555555555556) internal successors, (366), 270 states have internal predecessors, (366), 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-20 06:44:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 494 transitions. [2024-11-20 06:44:10,172 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 494 transitions. Word has length 115 [2024-11-20 06:44:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:10,173 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 494 transitions. [2024-11-20 06:44:10,173 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-20 06:44:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 494 transitions. [2024-11-20 06:44:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 06:44:10,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:10,175 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-20 06:44:10,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 06:44:10,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:10,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:10,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1104085425, now seen corresponding path program 1 times [2024-11-20 06:44:10,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:10,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065712473] [2024-11-20 06:44:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:10,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:11,543 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-20 06:44:11,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:11,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065712473] [2024-11-20 06:44:11,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065712473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:11,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:11,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:44:11,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048825191] [2024-11-20 06:44:11,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:11,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:44:11,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:11,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:44:11,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:44:11,546 INFO L87 Difference]: Start difference. First operand 339 states and 494 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-20 06:44:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:13,494 INFO L93 Difference]: Finished difference Result 757 states and 1100 transitions. [2024-11-20 06:44:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:44:13,495 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-20 06:44:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:13,497 INFO L225 Difference]: With dead ends: 757 [2024-11-20 06:44:13,497 INFO L226 Difference]: Without dead ends: 503 [2024-11-20 06:44:13,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:44:13,501 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 53 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:13,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 667 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 06:44:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-20 06:44:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 423. [2024-11-20 06:44:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 354 states have (on average 1.3672316384180792) internal successors, (484), 354 states have internal predecessors, (484), 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-20 06:44:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 612 transitions. [2024-11-20 06:44:13,529 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 612 transitions. Word has length 116 [2024-11-20 06:44:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:13,530 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 612 transitions. [2024-11-20 06:44:13,530 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-20 06:44:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 612 transitions. [2024-11-20 06:44:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 06:44:13,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:13,532 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-20 06:44:13,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 06:44:13,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:13,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2115202675, now seen corresponding path program 1 times [2024-11-20 06:44:13,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:13,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362205852] [2024-11-20 06:44:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:15,233 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-20 06:44:15,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:15,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362205852] [2024-11-20 06:44:15,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362205852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:15,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:15,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:44:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721170929] [2024-11-20 06:44:15,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:15,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:44:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:15,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:44:15,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:44:15,236 INFO L87 Difference]: Start difference. First operand 423 states and 612 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-20 06:44:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:16,961 INFO L93 Difference]: Finished difference Result 888 states and 1279 transitions. [2024-11-20 06:44:16,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:44:16,962 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-20 06:44:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:16,965 INFO L225 Difference]: With dead ends: 888 [2024-11-20 06:44:16,965 INFO L226 Difference]: Without dead ends: 571 [2024-11-20 06:44:16,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:44:16,968 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 53 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:16,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 761 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 06:44:16,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-11-20 06:44:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 423. [2024-11-20 06:44:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 354 states have (on average 1.3672316384180792) internal successors, (484), 354 states have internal predecessors, (484), 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-20 06:44:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 612 transitions. [2024-11-20 06:44:17,013 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 612 transitions. Word has length 116 [2024-11-20 06:44:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:17,014 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 612 transitions. [2024-11-20 06:44:17,014 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-20 06:44:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 612 transitions. [2024-11-20 06:44:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 06:44:17,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:17,015 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-20 06:44:17,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 06:44:17,016 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:17,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:17,016 INFO L85 PathProgramCache]: Analyzing trace with hash 450165509, now seen corresponding path program 1 times [2024-11-20 06:44:17,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:17,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269902697] [2024-11-20 06:44:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,249 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-20 06:44:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:17,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269902697] [2024-11-20 06:44:17,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269902697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:17,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:17,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 06:44:17,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452964982] [2024-11-20 06:44:17,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:17,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:44:17,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:17,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:44:17,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:44:17,252 INFO L87 Difference]: Start difference. First operand 423 states and 612 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-20 06:44:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:17,569 INFO L93 Difference]: Finished difference Result 886 states and 1270 transitions. [2024-11-20 06:44:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:44:17,570 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-20 06:44:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:17,573 INFO L225 Difference]: With dead ends: 886 [2024-11-20 06:44:17,573 INFO L226 Difference]: Without dead ends: 569 [2024-11-20 06:44:17,574 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-20 06:44:17,574 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 172 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 606 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-20 06:44:17,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 606 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:44:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-20 06:44:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 450. [2024-11-20 06:44:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 381 states have (on average 1.3648293963254594) internal successors, (520), 381 states have internal predecessors, (520), 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-20 06:44:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 648 transitions. [2024-11-20 06:44:17,603 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 648 transitions. Word has length 117 [2024-11-20 06:44:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:17,604 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 648 transitions. [2024-11-20 06:44:17,604 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-20 06:44:17,604 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 648 transitions. [2024-11-20 06:44:17,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 06:44:17,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:17,606 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-20 06:44:17,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 06:44:17,606 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:17,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:17,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2035710686, now seen corresponding path program 1 times [2024-11-20 06:44:17,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:17,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130601392] [2024-11-20 06:44:17,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:17,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:17,833 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-20 06:44:17,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:17,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130601392] [2024-11-20 06:44:17,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130601392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:17,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:17,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 06:44:17,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351867413] [2024-11-20 06:44:17,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:17,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:44:17,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:17,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:44:17,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:44:17,835 INFO L87 Difference]: Start difference. First operand 450 states and 648 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-20 06:44:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:18,151 INFO L93 Difference]: Finished difference Result 938 states and 1345 transitions. [2024-11-20 06:44:18,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:44:18,151 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-20 06:44:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:18,157 INFO L225 Difference]: With dead ends: 938 [2024-11-20 06:44:18,157 INFO L226 Difference]: Without dead ends: 621 [2024-11-20 06:44:18,158 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-20 06:44:18,159 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 174 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 912 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-20 06:44:18,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 912 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:44:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-20 06:44:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 553. [2024-11-20 06:44:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 466 states have (on average 1.349785407725322) internal successors, (629), 468 states have internal predecessors, (629), 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-20 06:44:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 789 transitions. [2024-11-20 06:44:18,193 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 789 transitions. Word has length 117 [2024-11-20 06:44:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:18,194 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 789 transitions. [2024-11-20 06:44:18,194 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-20 06:44:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 789 transitions. [2024-11-20 06:44:18,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 06:44:18,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:18,195 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:44:18,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 06:44:18,196 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:18,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:18,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1238361545, now seen corresponding path program 1 times [2024-11-20 06:44:18,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:18,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443589422] [2024-11-20 06:44:18,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:18,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,274 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-20 06:44:18,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:18,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443589422] [2024-11-20 06:44:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443589422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:18,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:44:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335290538] [2024-11-20 06:44:18,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:18,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:44:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:44:18,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:44:18,276 INFO L87 Difference]: Start difference. First operand 553 states and 789 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-20 06:44:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:18,332 INFO L93 Difference]: Finished difference Result 1194 states and 1698 transitions. [2024-11-20 06:44:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:44:18,333 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-20 06:44:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:18,338 INFO L225 Difference]: With dead ends: 1194 [2024-11-20 06:44:18,338 INFO L226 Difference]: Without dead ends: 786 [2024-11-20 06:44:18,339 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-20 06:44:18,340 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 51 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 203 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-20 06:44:18,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 203 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:44:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-20 06:44:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 781. [2024-11-20 06:44:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 676 states have (on average 1.3387573964497042) internal successors, (905), 681 states have internal predecessors, (905), 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-20 06:44:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1089 transitions. [2024-11-20 06:44:18,386 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1089 transitions. Word has length 118 [2024-11-20 06:44:18,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:18,386 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1089 transitions. [2024-11-20 06:44:18,386 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-20 06:44:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1089 transitions. [2024-11-20 06:44:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 06:44:18,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:18,388 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-20 06:44:18,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 06:44:18,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:18,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:18,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1512025676, now seen corresponding path program 1 times [2024-11-20 06:44:18,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:18,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698166531] [2024-11-20 06:44:18,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:18,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:18,766 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-20 06:44:18,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:18,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698166531] [2024-11-20 06:44:18,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698166531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:18,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:18,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 06:44:18,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454196794] [2024-11-20 06:44:18,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:18,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 06:44:18,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:18,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 06:44:18,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:44:18,770 INFO L87 Difference]: Start difference. First operand 781 states and 1089 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-20 06:44:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:19,010 INFO L93 Difference]: Finished difference Result 916 states and 1266 transitions. [2024-11-20 06:44:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 06:44:19,011 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-20 06:44:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:19,018 INFO L225 Difference]: With dead ends: 916 [2024-11-20 06:44:19,018 INFO L226 Difference]: Without dead ends: 914 [2024-11-20 06:44:19,019 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-20 06:44:19,020 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 65 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:19,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 735 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:44:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2024-11-20 06:44:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2024-11-20 06:44:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 759 states have (on average 1.308300395256917) internal successors, (993), 769 states have internal predecessors, (993), 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-20 06:44:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1257 transitions. [2024-11-20 06:44:19,128 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1257 transitions. Word has length 118 [2024-11-20 06:44:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:19,129 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1257 transitions. [2024-11-20 06:44:19,129 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-20 06:44:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1257 transitions. [2024-11-20 06:44:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 06:44:19,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:19,131 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-20 06:44:19,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 06:44:19,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:19,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:19,132 INFO L85 PathProgramCache]: Analyzing trace with hash -734222472, now seen corresponding path program 1 times [2024-11-20 06:44:19,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:19,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350159466] [2024-11-20 06:44:19,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:19,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:19,958 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-20 06:44:19,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:19,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350159466] [2024-11-20 06:44:19,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350159466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:19,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:19,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 06:44:19,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200720211] [2024-11-20 06:44:19,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:19,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 06:44:19,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:19,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 06:44:19,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:44:19,960 INFO L87 Difference]: Start difference. First operand 910 states and 1257 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-20 06:44:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:20,945 INFO L93 Difference]: Finished difference Result 2191 states and 3021 transitions. [2024-11-20 06:44:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 06:44:20,946 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-20 06:44:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:20,954 INFO L225 Difference]: With dead ends: 2191 [2024-11-20 06:44:20,954 INFO L226 Difference]: Without dead ends: 1498 [2024-11-20 06:44:20,956 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-20 06:44:20,957 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 64 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:20,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 814 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 06:44:20,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-11-20 06:44:21,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1218. [2024-11-20 06:44:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1039 states have (on average 1.3070259865255054) internal successors, (1358), 1052 states have internal predecessors, (1358), 156 states have call successors, (156), 22 states have call predecessors, (156), 22 states have return successors, (156), 143 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-20 06:44:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1670 transitions. [2024-11-20 06:44:21,104 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1670 transitions. Word has length 118 [2024-11-20 06:44:21,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:21,104 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1670 transitions. [2024-11-20 06:44:21,104 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-20 06:44:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1670 transitions. [2024-11-20 06:44:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 06:44:21,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:21,106 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-20 06:44:21,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 06:44:21,106 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:21,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:21,107 INFO L85 PathProgramCache]: Analyzing trace with hash 545641206, now seen corresponding path program 1 times [2024-11-20 06:44:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:21,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211955114] [2024-11-20 06:44:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:21,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:21,697 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-20 06:44:21,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:21,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211955114] [2024-11-20 06:44:21,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211955114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:21,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:21,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 06:44:21,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206202555] [2024-11-20 06:44:21,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:21,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 06:44:21,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:21,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 06:44:21,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:44:21,700 INFO L87 Difference]: Start difference. First operand 1218 states and 1670 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-20 06:44:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:22,909 INFO L93 Difference]: Finished difference Result 2517 states and 3432 transitions. [2024-11-20 06:44:22,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 06:44:22,910 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-20 06:44:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:22,917 INFO L225 Difference]: With dead ends: 2517 [2024-11-20 06:44:22,918 INFO L226 Difference]: Without dead ends: 1615 [2024-11-20 06:44:22,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:44:22,921 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 39 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:22,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 646 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 06:44:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-20 06:44:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1602. [2024-11-20 06:44:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1388 states have (on average 1.2845821325648414) internal successors, (1783), 1412 states have internal predecessors, (1783), 178 states have call successors, (178), 35 states have call predecessors, (178), 35 states have return successors, (178), 154 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-20 06:44:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2139 transitions. [2024-11-20 06:44:23,124 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2139 transitions. Word has length 118 [2024-11-20 06:44:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:23,124 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2139 transitions. [2024-11-20 06:44:23,124 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-20 06:44:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2139 transitions. [2024-11-20 06:44:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 06:44:23,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:23,128 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-20 06:44:23,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 06:44:23,128 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:23,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:23,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1079010836, now seen corresponding path program 1 times [2024-11-20 06:44:23,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:23,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813557549] [2024-11-20 06:44:23,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:23,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:23,431 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-20 06:44:23,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:23,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813557549] [2024-11-20 06:44:23,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813557549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:23,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:23,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 06:44:23,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388449758] [2024-11-20 06:44:23,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:23,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 06:44:23,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:23,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 06:44:23,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:44:23,437 INFO L87 Difference]: Start difference. First operand 1602 states and 2139 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 06:44:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:23,966 INFO L93 Difference]: Finished difference Result 3000 states and 4038 transitions. [2024-11-20 06:44:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 06:44:23,967 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), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 118 [2024-11-20 06:44:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:23,976 INFO L225 Difference]: With dead ends: 3000 [2024-11-20 06:44:23,976 INFO L226 Difference]: Without dead ends: 1848 [2024-11-20 06:44:23,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:44:23,979 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 189 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:23,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 447 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:44:23,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2024-11-20 06:44:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1828. [2024-11-20 06:44:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1562 states have (on average 1.267605633802817) internal successors, (1980), 1591 states have internal predecessors, (1980), 218 states have call successors, (218), 47 states have call predecessors, (218), 47 states have return successors, (218), 189 states have call predecessors, (218), 218 states have call successors, (218) [2024-11-20 06:44:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2416 transitions. [2024-11-20 06:44:24,261 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2416 transitions. Word has length 118 [2024-11-20 06:44:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:24,261 INFO L471 AbstractCegarLoop]: Abstraction has 1828 states and 2416 transitions. [2024-11-20 06:44:24,261 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), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 06:44:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2416 transitions. [2024-11-20 06:44:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 06:44:24,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:24,264 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-20 06:44:24,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 06:44:24,264 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:24,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash -654609696, now seen corresponding path program 1 times [2024-11-20 06:44:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:24,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607864888] [2024-11-20 06:44:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:24,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:24,342 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-20 06:44:24,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:24,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607864888] [2024-11-20 06:44:24,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607864888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:24,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:24,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:44:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573185572] [2024-11-20 06:44:24,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:24,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:44:24,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:24,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:44:24,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:44:24,346 INFO L87 Difference]: Start difference. First operand 1828 states and 2416 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-20 06:44:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:24,647 INFO L93 Difference]: Finished difference Result 3240 states and 4299 transitions. [2024-11-20 06:44:24,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:44:24,648 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-20 06:44:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:24,657 INFO L225 Difference]: With dead ends: 3240 [2024-11-20 06:44:24,657 INFO L226 Difference]: Without dead ends: 1854 [2024-11-20 06:44:24,661 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-20 06:44:24,661 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 50 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 258 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-20 06:44:24,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 258 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:44:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2024-11-20 06:44:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1385. [2024-11-20 06:44:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1191 states have (on average 1.2636439966414776) internal successors, (1505), 1206 states have internal predecessors, (1505), 158 states have call successors, (158), 35 states have call predecessors, (158), 35 states have return successors, (158), 143 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-20 06:44:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1821 transitions. [2024-11-20 06:44:24,809 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1821 transitions. Word has length 118 [2024-11-20 06:44:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:24,811 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1821 transitions. [2024-11-20 06:44:24,811 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-20 06:44:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1821 transitions. [2024-11-20 06:44:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 06:44:24,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:24,813 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-20 06:44:24,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 06:44:24,814 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:24,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash 230659259, now seen corresponding path program 1 times [2024-11-20 06:44:24,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:24,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785625154] [2024-11-20 06:44:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:25,225 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-20 06:44:25,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:25,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785625154] [2024-11-20 06:44:25,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785625154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:25,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:25,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:44:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799520187] [2024-11-20 06:44:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:25,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:44:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:25,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:44:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:44:25,227 INFO L87 Difference]: Start difference. First operand 1385 states and 1821 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-20 06:44:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:25,731 INFO L93 Difference]: Finished difference Result 2772 states and 3652 transitions. [2024-11-20 06:44:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:44:25,732 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-20 06:44:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:25,740 INFO L225 Difference]: With dead ends: 2772 [2024-11-20 06:44:25,740 INFO L226 Difference]: Without dead ends: 1634 [2024-11-20 06:44:25,743 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-20 06:44:25,744 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 137 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:25,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 749 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:44:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-20 06:44:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1385. [2024-11-20 06:44:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1191 states have (on average 1.260285474391268) internal successors, (1501), 1206 states have internal predecessors, (1501), 158 states have call successors, (158), 35 states have call predecessors, (158), 35 states have return successors, (158), 143 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-20 06:44:25,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1817 transitions. [2024-11-20 06:44:25,910 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1817 transitions. Word has length 119 [2024-11-20 06:44:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:25,911 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1817 transitions. [2024-11-20 06:44:25,911 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-20 06:44:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1817 transitions. [2024-11-20 06:44:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 06:44:25,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:25,913 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-20 06:44:25,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 06:44:25,914 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:25,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash -327146750, now seen corresponding path program 1 times [2024-11-20 06:44:25,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:25,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362487769] [2024-11-20 06:44:25,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:25,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:26,443 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-20 06:44:26,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:26,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362487769] [2024-11-20 06:44:26,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362487769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:26,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:26,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 06:44:26,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526307268] [2024-11-20 06:44:26,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:26,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 06:44:26,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:26,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 06:44:26,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:44:26,446 INFO L87 Difference]: Start difference. First operand 1385 states and 1817 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-20 06:44:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:27,230 INFO L93 Difference]: Finished difference Result 2715 states and 3584 transitions. [2024-11-20 06:44:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 06:44:27,231 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-20 06:44:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:27,239 INFO L225 Difference]: With dead ends: 2715 [2024-11-20 06:44:27,239 INFO L226 Difference]: Without dead ends: 1635 [2024-11-20 06:44:27,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-20 06:44:27,243 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 187 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:27,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 689 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 06:44:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-20 06:44:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1391. [2024-11-20 06:44:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1197 states have (on average 1.2589807852965749) internal successors, (1507), 1212 states have internal predecessors, (1507), 158 states have call successors, (158), 35 states have call predecessors, (158), 35 states have return successors, (158), 143 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-20 06:44:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1823 transitions. [2024-11-20 06:44:27,395 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1823 transitions. Word has length 119 [2024-11-20 06:44:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:27,396 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1823 transitions. [2024-11-20 06:44:27,396 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-20 06:44:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1823 transitions. [2024-11-20 06:44:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 06:44:27,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:27,398 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-20 06:44:27,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 06:44:27,398 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:27,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1350068558, now seen corresponding path program 1 times [2024-11-20 06:44:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:27,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558678063] [2024-11-20 06:44:27,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:27,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:44:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:44:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:44:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:44:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:44:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:44:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:44:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:44:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:44:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:44:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:44:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:44:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:44:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:44:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:44:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:44:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,612 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-20 06:44:27,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:44:27,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558678063] [2024-11-20 06:44:27,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558678063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:44:27,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830353254] [2024-11-20 06:44:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:27,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:44:27,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:44:27,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:44:27,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 06:44:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:27,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 06:44:27,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:44:27,897 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-20 06:44:27,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:44:28,141 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-20 06:44:28,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830353254] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:44:28,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:44:28,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2024-11-20 06:44:28,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886911736] [2024-11-20 06:44:28,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:44:28,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 06:44:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:44:28,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 06:44:28,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:44:28,145 INFO L87 Difference]: Start difference. First operand 1391 states and 1823 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-20 06:44:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:28,559 INFO L93 Difference]: Finished difference Result 2835 states and 3676 transitions. [2024-11-20 06:44:28,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 06:44:28,560 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-20 06:44:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:28,568 INFO L225 Difference]: With dead ends: 2835 [2024-11-20 06:44:28,568 INFO L226 Difference]: Without dead ends: 1489 [2024-11-20 06:44:28,570 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-20 06:44:28,571 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 290 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:28,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 252 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:44:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2024-11-20 06:44:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1423. [2024-11-20 06:44:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1221 states have (on average 1.2391482391482391) internal successors, (1513), 1236 states have internal predecessors, (1513), 158 states have call successors, (158), 43 states have call predecessors, (158), 43 states have return successors, (158), 143 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-20 06:44:28,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1829 transitions. [2024-11-20 06:44:28,729 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1829 transitions. Word has length 119 [2024-11-20 06:44:28,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:28,730 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1829 transitions. [2024-11-20 06:44:28,730 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-20 06:44:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1829 transitions. [2024-11-20 06:44:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 06:44:28,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:28,732 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-20 06:44:28,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 06:44:28,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:44:28,936 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:28,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:28,937 INFO L85 PathProgramCache]: Analyzing trace with hash 437433562, now seen corresponding path program 1 times [2024-11-20 06:44:28,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:44:28,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193767625] [2024-11-20 06:44:28,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:28,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:44:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:44:28,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969117449] [2024-11-20 06:44:28,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:28,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:44:28,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:44:28,993 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-20 06:44:28,995 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-20 06:44:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:44:29,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:44:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:44:29,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:44:29,203 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:44:29,204 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:44:29,215 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-20 06:44:29,406 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,SelfDestructingSolverStorable20 [2024-11-20 06:44:29,409 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, 1] [2024-11-20 06:44:29,498 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:44:29,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:44:29 BoogieIcfgContainer [2024-11-20 06:44:29,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:44:29,504 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:44:29,504 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:44:29,504 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:44:29,505 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:44:05" (3/4) ... [2024-11-20 06:44:29,507 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:44:29,508 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:44:29,509 INFO L158 Benchmark]: Toolchain (without parser) took 25020.66ms. Allocated memory was 184.5MB in the beginning and 564.1MB in the end (delta: 379.6MB). Free memory was 152.8MB in the beginning and 494.3MB in the end (delta: -341.5MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-11-20 06:44:29,509 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 82.2MB in the beginning and 82.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:44:29,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.46ms. Allocated memory is still 184.5MB. Free memory was 152.8MB in the beginning and 138.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 06:44:29,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.42ms. Allocated memory is still 184.5MB. Free memory was 138.6MB in the beginning and 134.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:44:29,510 INFO L158 Benchmark]: Boogie Preprocessor took 85.28ms. Allocated memory is still 184.5MB. Free memory was 134.4MB in the beginning and 129.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:44:29,511 INFO L158 Benchmark]: RCFGBuilder took 609.01ms. Allocated memory is still 184.5MB. Free memory was 129.2MB in the beginning and 104.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 06:44:29,511 INFO L158 Benchmark]: TraceAbstraction took 23877.18ms. Allocated memory was 184.5MB in the beginning and 564.1MB in the end (delta: 379.6MB). Free memory was 104.0MB in the beginning and 495.4MB in the end (delta: -391.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:44:29,511 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 564.1MB. Free memory is still 494.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:44:29,513 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.16ms. Allocated memory is still 121.6MB. Free memory was 82.2MB in the beginning and 82.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.46ms. Allocated memory is still 184.5MB. Free memory was 152.8MB in the beginning and 138.6MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.42ms. Allocated memory is still 184.5MB. Free memory was 138.6MB in the beginning and 134.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.28ms. Allocated memory is still 184.5MB. Free memory was 134.4MB in the beginning and 129.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 609.01ms. Allocated memory is still 184.5MB. Free memory was 129.2MB in the beginning and 104.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23877.18ms. Allocated memory was 184.5MB in the beginning and 564.1MB in the end (delta: 379.6MB). Free memory was 104.0MB in the beginning and 495.4MB in the end (delta: -391.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 564.1MB. Free memory is still 494.3MB. 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] COND TRUE 1 [L97] 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] [L97] RET updateLastVariables() [L98] 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=22] [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=22] [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=22] [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=22] [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=22] [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=22] [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=1, 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=22] [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=1, 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=22] [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=1, 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=22] [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=1, 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=22] [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=1, 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=22] [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=1, 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=22] [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=1, var_1_12=1, 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=22] [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=1, var_1_12=1, 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=22] [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=1, var_1_12=1, 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=22] [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=1, var_1_12=1, 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=22] [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=1, var_1_12=1, 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=22] [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=1, var_1_12=1, 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=22] [L98] RET updateVariables() [L99] 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=1, var_1_12=1, 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=22] [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=1, var_1_12=1, 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=22] [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=1, var_1_10=10, var_1_11=1, var_1_12=1, 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=22] [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=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [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=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [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=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [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=1, var_1_10=10, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L53] COND FALSE !((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) [L56] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L99] RET step() [L100] 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=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [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=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [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=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [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=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [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=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [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=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [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)) ; [L100] RET, EXPR property() [L100] 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=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=1, var_1_11=1, var_1_12=1, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=65536, var_1_5=1, var_1_6=21, var_1_7=1, var_1_8=-1, var_1_9=22] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.7s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2194 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2181 mSDsluCounter, 9881 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7469 mSDsCounter, 482 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2768 IncrementalHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 482 mSolverCounterUnsat, 2412 mSDtfsCounter, 2768 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1082 GetRequests, 933 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1828occurred in iteration=16, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 1974 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 2669 NumberOfCodeBlocks, 2669 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2526 ConstructedInterpolants, 0 QuantifiedInterpolants, 10714 SizeOfPredicates, 1 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 10530/10560 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-20 06:44:29,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_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 b3713b25a83a921fe666aac85c13dc353e68d0c4544ef354673bb4c8722689bd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:44:31,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:44:31,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:44:31,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:44:31,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:44:31,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:44:31,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:44:31,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:44:31,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:44:31,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:44:31,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:44:31,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:44:31,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:44:31,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:44:31,884 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:44:31,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:44:31,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:44:31,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:44:31,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:44:31,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:44:31,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:44:31,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:44:31,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:44:31,888 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:44:31,888 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:44:31,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:44:31,888 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:44:31,888 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:44:31,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:44:31,889 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:44:31,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:44:31,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:44:31,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:44:31,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:44:31,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:44:31,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:44:31,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:44:31,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:44:31,900 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:44:31,900 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:44:31,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:44:31,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:44:31,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:44:31,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:44:31,901 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 -> b3713b25a83a921fe666aac85c13dc353e68d0c4544ef354673bb4c8722689bd [2024-11-20 06:44:32,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:44:32,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:44:32,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:44:32,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:44:32,241 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:44:32,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i [2024-11-20 06:44:33,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:44:33,965 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:44:33,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-32.i [2024-11-20 06:44:33,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c8dba40/0e8c6550f8f34de1b60acf2dbd1e67a5/FLAG102f947fe [2024-11-20 06:44:34,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c8dba40/0e8c6550f8f34de1b60acf2dbd1e67a5 [2024-11-20 06:44:34,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:44:34,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:44:34,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:44:34,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:44:34,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:44:34,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e2e69ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34, skipping insertion in model container [2024-11-20 06:44:34,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:44:34,541 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-while_file-32.i[915,928] [2024-11-20 06:44:34,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:44:34,611 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:44:34,625 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-while_file-32.i[915,928] [2024-11-20 06:44:34,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:44:34,677 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:44:34,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34 WrapperNode [2024-11-20 06:44:34,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:44:34,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:44:34,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:44:34,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:44:34,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,730 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-20 06:44:34,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:44:34,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:44:34,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:44:34,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:44:34,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,782 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:44:34,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:44:34,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:44:34,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:44:34,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:44:34,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (1/1) ... [2024-11-20 06:44:34,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:44:34,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:44:34,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:44:34,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:44:34,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:44:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:44:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:44:34,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:44:34,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:44:34,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:44:34,990 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:44:34,994 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:44:35,307 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 06:44:35,307 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:44:35,323 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:44:35,323 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:44:35,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:44:35 BoogieIcfgContainer [2024-11-20 06:44:35,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:44:35,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:44:35,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:44:35,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:44:35,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:44:34" (1/3) ... [2024-11-20 06:44:35,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0b4990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:44:35, skipping insertion in model container [2024-11-20 06:44:35,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:44:34" (2/3) ... [2024-11-20 06:44:35,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0b4990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:44:35, skipping insertion in model container [2024-11-20 06:44:35,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:44:35" (3/3) ... [2024-11-20 06:44:35,331 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-32.i [2024-11-20 06:44:35,346 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:44:35,346 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:44:35,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:44:35,412 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;@4a8a35a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:44:35,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:44:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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-20 06:44:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 06:44:35,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:35,427 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-20 06:44:35,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:35,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:35,433 INFO L85 PathProgramCache]: Analyzing trace with hash -825664696, now seen corresponding path program 1 times [2024-11-20 06:44:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:44:35,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824740197] [2024-11-20 06:44:35,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:35,446 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-20 06:44:35,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:44:35,450 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-20 06:44:35,451 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-20 06:44:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:35,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 06:44:35,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:44:35,985 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-20 06:44:35,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:44:35,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:44:35,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824740197] [2024-11-20 06:44:35,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824740197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:44:35,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:44:35,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:44:35,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592642782] [2024-11-20 06:44:35,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:44:35,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:44:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:44:36,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:44:36,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:44:36,020 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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 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-20 06:44:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:44:36,198 INFO L93 Difference]: Finished difference Result 142 states and 250 transitions. [2024-11-20 06:44:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:44:36,206 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-20 06:44:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:44:36,217 INFO L225 Difference]: With dead ends: 142 [2024-11-20 06:44:36,218 INFO L226 Difference]: Without dead ends: 96 [2024-11-20 06:44:36,221 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-20 06:44:36,224 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 45 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 187 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.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:44:36,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 187 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:44:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-20 06:44:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2024-11-20 06:44:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 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-20 06:44:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2024-11-20 06:44:36,289 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 102 [2024-11-20 06:44:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:44:36,290 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2024-11-20 06:44:36,293 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-20 06:44:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2024-11-20 06:44:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 06:44:36,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:44:36,296 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-20 06:44:36,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 06:44:36,502 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-20 06:44:36,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:44:36,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:44:36,504 INFO L85 PathProgramCache]: Analyzing trace with hash -145606326, now seen corresponding path program 1 times [2024-11-20 06:44:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:44:36,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748607026] [2024-11-20 06:44:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:44:36,505 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-20 06:44:36,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:44:36,507 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-20 06:44:36,508 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-20 06:44:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:44:36,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 06:44:36,645 INFO L278 TraceCheckSpWp]: Computing forward predicates...