./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.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 e16c5a025919373f7b296a1dca27c9a462a1ec91557da14151f7e36b86babe44 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:51:51,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:51:51,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:51:51,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:51:51,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:51:51,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:51:51,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:51:51,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:51:51,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:51:51,833 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:51:51,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:51:51,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:51:51,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:51:51,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:51:51,835 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:51:51,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:51:51,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:51:51,836 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:51:51,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:51:51,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:51:51,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:51:51,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:51:51,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:51:51,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:51:51,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:51:51,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:51:51,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:51:51,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:51:51,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:51:51,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:51:51,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:51:51,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:51:51,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:51:51,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:51:51,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:51:51,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:51:51,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:51:51,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:51:51,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:51:51,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:51:51,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:51:51,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:51:51,854 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 -> e16c5a025919373f7b296a1dca27c9a462a1ec91557da14151f7e36b86babe44 [2024-11-10 07:51:52,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:51:52,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:51:52,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:51:52,182 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:51:52,185 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:51:52,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i [2024-11-10 07:51:53,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:51:53,984 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:51:53,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i [2024-11-10 07:51:53,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5858f5c73/d8231cb1c6664d8b8405eb0dd46c577d/FLAGbfaf691e6 [2024-11-10 07:51:54,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5858f5c73/d8231cb1c6664d8b8405eb0dd46c577d [2024-11-10 07:51:54,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:51:54,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:51:54,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:51:54,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:51:54,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:51:54,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3e7813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54, skipping insertion in model container [2024-11-10 07:51:54,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:51:54,271 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_50-1loop_file-84.i[915,928] [2024-11-10 07:51:54,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:51:54,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:51:54,395 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_50-1loop_file-84.i[915,928] [2024-11-10 07:51:54,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:51:54,447 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:51:54,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54 WrapperNode [2024-11-10 07:51:54,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:51:54,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:51:54,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:51:54,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:51:54,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,512 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-10 07:51:54,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:51:54,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:51:54,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:51:54,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:51:54,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,562 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-10 07:51:54,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:51:54,595 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:51:54,596 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:51:54,596 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:51:54,597 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (1/1) ... [2024-11-10 07:51:54,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:51:54,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:51:54,642 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-10 07:51:54,645 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-10 07:51:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:51:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:51:54,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:51:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:51:54,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:51:54,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:51:54,796 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:51:54,798 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:51:55,239 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~bitwise16#1;havoc property_#t~short17#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2024-11-10 07:51:55,277 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 07:51:55,278 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:51:55,312 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:51:55,313 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:51:55,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:51:55 BoogieIcfgContainer [2024-11-10 07:51:55,314 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:51:55,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:51:55,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:51:55,321 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:51:55,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:51:54" (1/3) ... [2024-11-10 07:51:55,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac0e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:51:55, skipping insertion in model container [2024-11-10 07:51:55,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:54" (2/3) ... [2024-11-10 07:51:55,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac0e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:51:55, skipping insertion in model container [2024-11-10 07:51:55,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:51:55" (3/3) ... [2024-11-10 07:51:55,325 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-84.i [2024-11-10 07:51:55,344 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:51:55,345 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:51:55,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:51:55,421 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;@29fbd0f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:51:55,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:51:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 07:51:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:51:55,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:51:55,445 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:51:55,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:51:55,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:51:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2118186531, now seen corresponding path program 1 times [2024-11-10 07:51:55,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:51:55,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63216160] [2024-11-10 07:51:55,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:51:55,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:51:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:51:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:51:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:51:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:51:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:51:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:51:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:51:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:51:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:51:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:51:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:51:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:51:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:51:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:55,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:51:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:51:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:51:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:51:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:51:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:51:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:51:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:51:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:51:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:51:56,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:51:56,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63216160] [2024-11-10 07:51:56,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63216160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:51:56,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:51:56,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:51:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237761400] [2024-11-10 07:51:56,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:51:56,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:51:56,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:51:56,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:51:56,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:51:56,113 INFO L87 Difference]: Start difference. First operand has 84 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 07:51:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:51:56,173 INFO L93 Difference]: Finished difference Result 164 states and 270 transitions. [2024-11-10 07:51:56,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:51:56,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 147 [2024-11-10 07:51:56,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:51:56,186 INFO L225 Difference]: With dead ends: 164 [2024-11-10 07:51:56,186 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 07:51:56,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-10 07:51:56,194 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:51:56,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:51:56,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 07:51:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-10 07:51:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 07:51:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2024-11-10 07:51:56,259 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 118 transitions. Word has length 147 [2024-11-10 07:51:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:51:56,260 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 118 transitions. [2024-11-10 07:51:56,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 07:51:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 118 transitions. [2024-11-10 07:51:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:51:56,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:51:56,264 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:51:56,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:51:56,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:51:56,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:51:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash 398112445, now seen corresponding path program 1 times [2024-11-10 07:51:56,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:51:56,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528907282] [2024-11-10 07:51:56,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:51:56,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:51:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:51:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:51:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:51:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:51:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:51:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:51:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:51:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:51:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:51:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:51:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:51:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:51:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:51:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:51:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:51:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:51:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:51:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:51:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:51:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:51:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:51:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:51:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:51:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:51:56,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:51:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528907282] [2024-11-10 07:51:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528907282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:51:56,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:51:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:51:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181939998] [2024-11-10 07:51:56,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:51:56,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:51:56,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:51:56,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:51:56,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:51:56,860 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:51:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:51:56,930 INFO L93 Difference]: Finished difference Result 155 states and 233 transitions. [2024-11-10 07:51:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:51:56,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-10 07:51:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:51:56,935 INFO L225 Difference]: With dead ends: 155 [2024-11-10 07:51:56,935 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 07:51:56,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-10 07:51:56,940 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:51:56,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:51:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 07:51:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-10 07:51:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 07:51:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 117 transitions. [2024-11-10 07:51:56,962 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 117 transitions. Word has length 147 [2024-11-10 07:51:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:51:56,965 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 117 transitions. [2024-11-10 07:51:56,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:51:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 117 transitions. [2024-11-10 07:51:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:51:56,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:51:56,970 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:51:56,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:51:56,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:51:56,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:51:56,971 INFO L85 PathProgramCache]: Analyzing trace with hash 104709438, now seen corresponding path program 1 times [2024-11-10 07:51:56,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:51:56,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980758102] [2024-11-10 07:51:56,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:51:56,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:51:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:00,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:00,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980758102] [2024-11-10 07:52:00,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980758102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:00,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:00,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:52:00,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813534928] [2024-11-10 07:52:00,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:00,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:52:00,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:52:00,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:52:00,901 INFO L87 Difference]: Start difference. First operand 79 states and 117 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:04,750 INFO L93 Difference]: Finished difference Result 351 states and 486 transitions. [2024-11-10 07:52:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 07:52:04,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-10 07:52:04,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:04,760 INFO L225 Difference]: With dead ends: 351 [2024-11-10 07:52:04,761 INFO L226 Difference]: Without dead ends: 275 [2024-11-10 07:52:04,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-11-10 07:52:04,763 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 342 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:04,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 750 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 07:52:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-10 07:52:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 132. [2024-11-10 07:52:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 105 states have (on average 1.380952380952381) internal successors, (145), 106 states have internal predecessors, (145), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:52:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 193 transitions. [2024-11-10 07:52:04,802 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 193 transitions. Word has length 147 [2024-11-10 07:52:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:04,803 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 193 transitions. [2024-11-10 07:52:04,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 193 transitions. [2024-11-10 07:52:04,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 07:52:04,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:04,810 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:04,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:52:04,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:04,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash -482871597, now seen corresponding path program 1 times [2024-11-10 07:52:04,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:04,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202708129] [2024-11-10 07:52:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:04,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:07,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:07,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202708129] [2024-11-10 07:52:07,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202708129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:07,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:07,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:52:07,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948589512] [2024-11-10 07:52:07,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:07,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:52:07,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:52:07,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:52:07,425 INFO L87 Difference]: Start difference. First operand 132 states and 193 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:09,905 INFO L93 Difference]: Finished difference Result 523 states and 716 transitions. [2024-11-10 07:52:09,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 07:52:09,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-10 07:52:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:09,910 INFO L225 Difference]: With dead ends: 523 [2024-11-10 07:52:09,911 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 07:52:09,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-11-10 07:52:09,913 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 472 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:09,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 685 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 07:52:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 07:52:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 134. [2024-11-10 07:52:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 107 states have (on average 1.3925233644859814) internal successors, (149), 108 states have internal predecessors, (149), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:52:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 197 transitions. [2024-11-10 07:52:09,934 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 197 transitions. Word has length 148 [2024-11-10 07:52:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:09,934 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 197 transitions. [2024-11-10 07:52:09,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2024-11-10 07:52:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 07:52:09,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:09,940 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:09,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:52:09,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:09,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:09,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1709895192, now seen corresponding path program 1 times [2024-11-10 07:52:09,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:09,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758612043] [2024-11-10 07:52:09,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:09,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:12,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758612043] [2024-11-10 07:52:12,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758612043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:12,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:12,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 07:52:12,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33185644] [2024-11-10 07:52:12,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:12,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:52:12,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:12,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:52:12,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:52:12,165 INFO L87 Difference]: Start difference. First operand 134 states and 197 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:12,808 INFO L93 Difference]: Finished difference Result 332 states and 479 transitions. [2024-11-10 07:52:12,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:52:12,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-10 07:52:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:12,811 INFO L225 Difference]: With dead ends: 332 [2024-11-10 07:52:12,811 INFO L226 Difference]: Without dead ends: 201 [2024-11-10 07:52:12,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:52:12,813 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 73 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:12,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 397 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:52:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-10 07:52:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 182. [2024-11-10 07:52:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 147 states have (on average 1.3401360544217686) internal successors, (197), 150 states have internal predecessors, (197), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 07:52:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 257 transitions. [2024-11-10 07:52:12,838 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 257 transitions. Word has length 148 [2024-11-10 07:52:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:12,840 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 257 transitions. [2024-11-10 07:52:12,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 257 transitions. [2024-11-10 07:52:12,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 07:52:12,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:12,842 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:12,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 07:52:12,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:12,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1937056034, now seen corresponding path program 1 times [2024-11-10 07:52:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:12,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138967511] [2024-11-10 07:52:12,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:12,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:15,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:15,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138967511] [2024-11-10 07:52:15,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138967511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:15,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:15,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 07:52:15,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043150711] [2024-11-10 07:52:15,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:15,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:52:15,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:15,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:52:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:52:15,727 INFO L87 Difference]: Start difference. First operand 182 states and 257 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:16,989 INFO L93 Difference]: Finished difference Result 425 states and 594 transitions. [2024-11-10 07:52:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 07:52:16,993 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-10 07:52:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:16,997 INFO L225 Difference]: With dead ends: 425 [2024-11-10 07:52:16,997 INFO L226 Difference]: Without dead ends: 246 [2024-11-10 07:52:16,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:52:16,999 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 64 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:17,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 546 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 07:52:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-10 07:52:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 189. [2024-11-10 07:52:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 157 states have internal predecessors, (206), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 07:52:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 266 transitions. [2024-11-10 07:52:17,033 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 266 transitions. Word has length 148 [2024-11-10 07:52:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:17,037 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 266 transitions. [2024-11-10 07:52:17,037 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 266 transitions. [2024-11-10 07:52:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 07:52:17,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:17,039 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:17,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 07:52:17,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:17,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:17,039 INFO L85 PathProgramCache]: Analyzing trace with hash -429504225, now seen corresponding path program 1 times [2024-11-10 07:52:17,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:17,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774983885] [2024-11-10 07:52:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:17,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:19,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774983885] [2024-11-10 07:52:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774983885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:19,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:19,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 07:52:19,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11657804] [2024-11-10 07:52:19,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:19,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:52:19,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:19,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:52:19,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:52:19,259 INFO L87 Difference]: Start difference. First operand 189 states and 266 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:20,518 INFO L93 Difference]: Finished difference Result 406 states and 565 transitions. [2024-11-10 07:52:20,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 07:52:20,518 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-10 07:52:20,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:20,520 INFO L225 Difference]: With dead ends: 406 [2024-11-10 07:52:20,520 INFO L226 Difference]: Without dead ends: 220 [2024-11-10 07:52:20,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:52:20,522 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:20,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 542 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 07:52:20,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-10 07:52:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 155. [2024-11-10 07:52:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.319672131147541) internal successors, (161), 124 states have internal predecessors, (161), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:52:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 217 transitions. [2024-11-10 07:52:20,546 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 217 transitions. Word has length 148 [2024-11-10 07:52:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:20,548 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 217 transitions. [2024-11-10 07:52:20,548 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 217 transitions. [2024-11-10 07:52:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 07:52:20,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:20,550 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:20,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 07:52:20,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:20,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:20,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1752858752, now seen corresponding path program 1 times [2024-11-10 07:52:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:20,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990246365] [2024-11-10 07:52:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:20,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:24,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:24,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990246365] [2024-11-10 07:52:24,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990246365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:24,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:24,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:52:24,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797613561] [2024-11-10 07:52:24,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:24,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:52:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:24,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:52:24,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:52:24,820 INFO L87 Difference]: Start difference. First operand 155 states and 217 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:25,930 INFO L93 Difference]: Finished difference Result 412 states and 570 transitions. [2024-11-10 07:52:25,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:52:25,931 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2024-11-10 07:52:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:25,936 INFO L225 Difference]: With dead ends: 412 [2024-11-10 07:52:25,936 INFO L226 Difference]: Without dead ends: 260 [2024-11-10 07:52:25,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:52:25,937 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 89 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:25,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 581 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 07:52:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-10 07:52:25,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 186. [2024-11-10 07:52:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 153 states have (on average 1.3333333333333333) internal successors, (204), 155 states have internal predecessors, (204), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:52:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 260 transitions. [2024-11-10 07:52:25,971 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 260 transitions. Word has length 149 [2024-11-10 07:52:25,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:25,972 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 260 transitions. [2024-11-10 07:52:25,972 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 260 transitions. [2024-11-10 07:52:25,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 07:52:25,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:25,973 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:25,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 07:52:25,974 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:25,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1623776033, now seen corresponding path program 1 times [2024-11-10 07:52:25,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:25,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780920411] [2024-11-10 07:52:25,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:25,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:28,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:28,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780920411] [2024-11-10 07:52:28,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780920411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:28,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:28,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 07:52:28,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176359938] [2024-11-10 07:52:28,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:28,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 07:52:28,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:28,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 07:52:28,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-10 07:52:28,574 INFO L87 Difference]: Start difference. First operand 186 states and 260 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:29,752 INFO L93 Difference]: Finished difference Result 457 states and 631 transitions. [2024-11-10 07:52:29,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 07:52:29,756 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2024-11-10 07:52:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:29,758 INFO L225 Difference]: With dead ends: 457 [2024-11-10 07:52:29,758 INFO L226 Difference]: Without dead ends: 274 [2024-11-10 07:52:29,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-11-10 07:52:29,762 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 311 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:29,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 390 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 07:52:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-10 07:52:29,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 190. [2024-11-10 07:52:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 157 states have (on average 1.3375796178343948) internal successors, (210), 159 states have internal predecessors, (210), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:52:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 266 transitions. [2024-11-10 07:52:29,788 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 266 transitions. Word has length 149 [2024-11-10 07:52:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:29,788 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 266 transitions. [2024-11-10 07:52:29,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 266 transitions. [2024-11-10 07:52:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 07:52:29,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:29,794 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:29,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 07:52:29,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:29,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:29,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2129334658, now seen corresponding path program 1 times [2024-11-10 07:52:29,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:29,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775128884] [2024-11-10 07:52:29,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:29,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:32,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775128884] [2024-11-10 07:52:32,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775128884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:32,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:32,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 07:52:32,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887012830] [2024-11-10 07:52:32,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:32,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 07:52:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:32,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 07:52:32,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:52:32,089 INFO L87 Difference]: Start difference. First operand 190 states and 266 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:33,177 INFO L93 Difference]: Finished difference Result 455 states and 629 transitions. [2024-11-10 07:52:33,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 07:52:33,177 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2024-11-10 07:52:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:33,179 INFO L225 Difference]: With dead ends: 455 [2024-11-10 07:52:33,179 INFO L226 Difference]: Without dead ends: 268 [2024-11-10 07:52:33,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-10 07:52:33,181 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 133 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:33,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 674 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 07:52:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-10 07:52:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 186. [2024-11-10 07:52:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 153 states have (on average 1.3333333333333333) internal successors, (204), 155 states have internal predecessors, (204), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:52:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 260 transitions. [2024-11-10 07:52:33,206 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 260 transitions. Word has length 149 [2024-11-10 07:52:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:33,206 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 260 transitions. [2024-11-10 07:52:33,206 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 260 transitions. [2024-11-10 07:52:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 07:52:33,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:33,208 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:33,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 07:52:33,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:33,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash 517449685, now seen corresponding path program 1 times [2024-11-10 07:52:33,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:33,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183744044] [2024-11-10 07:52:33,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:33,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:33,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183744044] [2024-11-10 07:52:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183744044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:33,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:52:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501957247] [2024-11-10 07:52:33,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:33,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:52:33,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:33,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:52:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:52:33,302 INFO L87 Difference]: Start difference. First operand 186 states and 260 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:33,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:33,410 INFO L93 Difference]: Finished difference Result 443 states and 611 transitions. [2024-11-10 07:52:33,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:52:33,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-11-10 07:52:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:33,414 INFO L225 Difference]: With dead ends: 443 [2024-11-10 07:52:33,414 INFO L226 Difference]: Without dead ends: 260 [2024-11-10 07:52:33,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-10 07:52:33,415 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:33,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 201 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:52:33,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-10 07:52:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 176. [2024-11-10 07:52:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 146 states have internal predecessors, (192), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 07:52:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 244 transitions. [2024-11-10 07:52:33,440 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 244 transitions. Word has length 150 [2024-11-10 07:52:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:33,440 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 244 transitions. [2024-11-10 07:52:33,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 244 transitions. [2024-11-10 07:52:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 07:52:33,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:33,443 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:33,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 07:52:33,443 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:33,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:33,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1062608422, now seen corresponding path program 1 times [2024-11-10 07:52:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062108624] [2024-11-10 07:52:33,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:33,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:33,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:33,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062108624] [2024-11-10 07:52:33,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062108624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:33,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:33,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:52:33,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115099873] [2024-11-10 07:52:33,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:33,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:52:33,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:33,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:52:33,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:52:33,692 INFO L87 Difference]: Start difference. First operand 176 states and 244 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:33,886 INFO L93 Difference]: Finished difference Result 489 states and 678 transitions. [2024-11-10 07:52:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:52:33,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-11-10 07:52:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:33,889 INFO L225 Difference]: With dead ends: 489 [2024-11-10 07:52:33,890 INFO L226 Difference]: Without dead ends: 316 [2024-11-10 07:52:33,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:52:33,891 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 91 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:33,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 376 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:52:33,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-10 07:52:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 225. [2024-11-10 07:52:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 169 states have (on average 1.2840236686390532) internal successors, (217), 170 states have internal predecessors, (217), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:52:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 313 transitions. [2024-11-10 07:52:33,930 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 313 transitions. Word has length 150 [2024-11-10 07:52:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:33,930 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 313 transitions. [2024-11-10 07:52:33,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 313 transitions. [2024-11-10 07:52:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-10 07:52:33,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:33,932 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:33,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 07:52:33,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:33,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:33,933 INFO L85 PathProgramCache]: Analyzing trace with hash -210715396, now seen corresponding path program 1 times [2024-11-10 07:52:33,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:33,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685257356] [2024-11-10 07:52:33,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:33,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:33,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:34,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685257356] [2024-11-10 07:52:34,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685257356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:34,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:34,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:52:34,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011893820] [2024-11-10 07:52:34,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:34,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:52:34,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:34,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:52:34,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:52:34,030 INFO L87 Difference]: Start difference. First operand 225 states and 313 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:34,144 INFO L93 Difference]: Finished difference Result 443 states and 608 transitions. [2024-11-10 07:52:34,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:52:34,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-11-10 07:52:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:34,148 INFO L225 Difference]: With dead ends: 443 [2024-11-10 07:52:34,149 INFO L226 Difference]: Without dead ends: 270 [2024-11-10 07:52:34,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-10 07:52:34,150 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 41 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:34,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 187 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:52:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-10 07:52:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2024-11-10 07:52:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 169 states have (on average 1.2603550295857988) internal successors, (213), 170 states have internal predecessors, (213), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:52:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 309 transitions. [2024-11-10 07:52:34,187 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 309 transitions. Word has length 150 [2024-11-10 07:52:34,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:34,188 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 309 transitions. [2024-11-10 07:52:34,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 309 transitions. [2024-11-10 07:52:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 07:52:34,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:34,190 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:34,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 07:52:34,190 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:34,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:34,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1449369415, now seen corresponding path program 1 times [2024-11-10 07:52:34,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:34,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89766165] [2024-11-10 07:52:34,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:34,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:36,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:36,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89766165] [2024-11-10 07:52:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89766165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:36,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:36,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:52:36,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869206016] [2024-11-10 07:52:36,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:36,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:52:36,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:52:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:52:36,061 INFO L87 Difference]: Start difference. First operand 225 states and 309 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:36,837 INFO L93 Difference]: Finished difference Result 544 states and 733 transitions. [2024-11-10 07:52:36,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:52:36,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-10 07:52:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:36,841 INFO L225 Difference]: With dead ends: 544 [2024-11-10 07:52:36,841 INFO L226 Difference]: Without dead ends: 371 [2024-11-10 07:52:36,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:52:36,842 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 111 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:36,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 671 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 07:52:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-10 07:52:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 252. [2024-11-10 07:52:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 196 states have (on average 1.2857142857142858) internal successors, (252), 197 states have internal predecessors, (252), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:52:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 348 transitions. [2024-11-10 07:52:36,877 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 348 transitions. Word has length 151 [2024-11-10 07:52:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:36,877 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 348 transitions. [2024-11-10 07:52:36,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 348 transitions. [2024-11-10 07:52:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 07:52:36,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:36,879 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:36,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 07:52:36,879 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:36,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1155966408, now seen corresponding path program 1 times [2024-11-10 07:52:36,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:36,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616192690] [2024-11-10 07:52:36,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:36,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:39,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:39,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616192690] [2024-11-10 07:52:39,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616192690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:39,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 07:52:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623032397] [2024-11-10 07:52:39,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:39,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 07:52:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:39,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 07:52:39,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-10 07:52:39,330 INFO L87 Difference]: Start difference. First operand 252 states and 348 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:40,976 INFO L93 Difference]: Finished difference Result 546 states and 740 transitions. [2024-11-10 07:52:40,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 07:52:40,980 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-10 07:52:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:40,983 INFO L225 Difference]: With dead ends: 546 [2024-11-10 07:52:40,983 INFO L226 Difference]: Without dead ends: 346 [2024-11-10 07:52:40,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-10 07:52:40,986 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 265 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:40,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 520 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 07:52:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-10 07:52:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 252. [2024-11-10 07:52:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 196 states have (on average 1.2857142857142858) internal successors, (252), 197 states have internal predecessors, (252), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:52:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 348 transitions. [2024-11-10 07:52:41,022 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 348 transitions. Word has length 151 [2024-11-10 07:52:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:41,023 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 348 transitions. [2024-11-10 07:52:41,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 348 transitions. [2024-11-10 07:52:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 07:52:41,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:41,024 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:41,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 07:52:41,024 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:41,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1338046072, now seen corresponding path program 1 times [2024-11-10 07:52:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:41,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348529676] [2024-11-10 07:52:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:42,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:42,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348529676] [2024-11-10 07:52:42,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348529676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:42,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:42,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:52:42,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247612182] [2024-11-10 07:52:42,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:42,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:52:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:42,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:52:42,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:52:42,680 INFO L87 Difference]: Start difference. First operand 252 states and 348 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:43,543 INFO L93 Difference]: Finished difference Result 577 states and 778 transitions. [2024-11-10 07:52:43,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:52:43,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-10 07:52:43,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:43,550 INFO L225 Difference]: With dead ends: 577 [2024-11-10 07:52:43,550 INFO L226 Difference]: Without dead ends: 377 [2024-11-10 07:52:43,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:52:43,552 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 107 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:43,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 615 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 07:52:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-10 07:52:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 256. [2024-11-10 07:52:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 200 states have (on average 1.29) internal successors, (258), 201 states have internal predecessors, (258), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:52:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 354 transitions. [2024-11-10 07:52:43,589 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 354 transitions. Word has length 151 [2024-11-10 07:52:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:43,590 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 354 transitions. [2024-11-10 07:52:43,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 354 transitions. [2024-11-10 07:52:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 07:52:43,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:43,591 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:43,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 07:52:43,592 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:43,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:43,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1631449079, now seen corresponding path program 1 times [2024-11-10 07:52:43,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:43,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331737456] [2024-11-10 07:52:43,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:43,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:52:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:52:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:52:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:52:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:52:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:52:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:52:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:52:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:52:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:52:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:52:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 07:52:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:52:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 07:52:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:52:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 07:52:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-10 07:52:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-10 07:52:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-10 07:52:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-10 07:52:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 07:52:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-10 07:52:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:45,324 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:45,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:52:45,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331737456] [2024-11-10 07:52:45,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331737456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:45,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:45,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:52:45,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113557609] [2024-11-10 07:52:45,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:45,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:52:45,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:52:45,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:52:45,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:52:45,327 INFO L87 Difference]: Start difference. First operand 256 states and 354 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:46,282 INFO L93 Difference]: Finished difference Result 556 states and 752 transitions. [2024-11-10 07:52:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 07:52:46,283 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-10 07:52:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:46,285 INFO L225 Difference]: With dead ends: 556 [2024-11-10 07:52:46,286 INFO L226 Difference]: Without dead ends: 352 [2024-11-10 07:52:46,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-10 07:52:46,287 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 111 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:46,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 629 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 07:52:46,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-10 07:52:46,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 252. [2024-11-10 07:52:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 196 states have (on average 1.2857142857142858) internal successors, (252), 197 states have internal predecessors, (252), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 07:52:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 348 transitions. [2024-11-10 07:52:46,325 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 348 transitions. Word has length 151 [2024-11-10 07:52:46,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:46,325 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 348 transitions. [2024-11-10 07:52:46,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 348 transitions. [2024-11-10 07:52:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-10 07:52:46,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:46,327 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:46,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 07:52:46,327 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:46,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:46,327 INFO L85 PathProgramCache]: Analyzing trace with hash -718657854, now seen corresponding path program 1 times [2024-11-10 07:52:46,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:52:46,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010365142] [2024-11-10 07:52:46,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:46,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:52:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:52:46,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1598685046] [2024-11-10 07:52:46,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:46,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:52:46,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:52:46,405 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-10 07:52:46,406 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-10 07:52:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:52:46,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:52:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:52:46,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:52:46,717 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:52:46,718 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:52:46,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:52:46,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 07:52:46,927 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:52:47,041 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:52:47,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:52:47 BoogieIcfgContainer [2024-11-10 07:52:47,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:52:47,046 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:52:47,046 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:52:47,047 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:52:47,047 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:51:55" (3/4) ... [2024-11-10 07:52:47,050 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:52:47,051 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:52:47,052 INFO L158 Benchmark]: Toolchain (without parser) took 53037.20ms. Allocated memory was 146.8MB in the beginning and 488.6MB in the end (delta: 341.8MB). Free memory was 74.4MB in the beginning and 246.8MB in the end (delta: -172.4MB). Peak memory consumption was 171.5MB. Max. memory is 16.1GB. [2024-11-10 07:52:47,052 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 146.8MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:52:47,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.83ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 74.3MB in the beginning and 154.1MB in the end (delta: -79.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:52:47,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.79ms. Allocated memory is still 186.6MB. Free memory was 154.1MB in the beginning and 150.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:52:47,053 INFO L158 Benchmark]: Boogie Preprocessor took 80.73ms. Allocated memory is still 186.6MB. Free memory was 150.9MB in the beginning and 145.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:52:47,054 INFO L158 Benchmark]: IcfgBuilder took 718.74ms. Allocated memory is still 186.6MB. Free memory was 145.7MB in the beginning and 117.4MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 07:52:47,054 INFO L158 Benchmark]: TraceAbstraction took 51729.26ms. Allocated memory was 186.6MB in the beginning and 488.6MB in the end (delta: 302.0MB). Free memory was 116.3MB in the beginning and 246.8MB in the end (delta: -130.5MB). Peak memory consumption was 171.5MB. Max. memory is 16.1GB. [2024-11-10 07:52:47,054 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 488.6MB. Free memory is still 246.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:52:47,056 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.31ms. Allocated memory is still 146.8MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.83ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 74.3MB in the beginning and 154.1MB in the end (delta: -79.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.79ms. Allocated memory is still 186.6MB. Free memory was 154.1MB in the beginning and 150.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.73ms. Allocated memory is still 186.6MB. Free memory was 150.9MB in the beginning and 145.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 718.74ms. Allocated memory is still 186.6MB. Free memory was 145.7MB in the beginning and 117.4MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 51729.26ms. Allocated memory was 186.6MB in the beginning and 488.6MB in the end (delta: 302.0MB). Free memory was 116.3MB in the beginning and 246.8MB in the end (delta: -130.5MB). Peak memory consumption was 171.5MB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 488.6MB. Free memory is still 246.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L123] isInitial = 1 [L124] FCALL initially() [L125] int k_loop; [L126] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L126] COND TRUE k_loop < 1 [L127] CALL updateLastVariables() [L116] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L82] var_1_3 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L92] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=-4, var_1_9=50] [L95] var_1_8 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L96] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L97] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L98] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L100] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L101] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L104] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L105] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L106] var_1_16 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L108] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L109] var_1_17 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L110] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L111] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L113] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L128] RET updateVariables() [L129] CALL step() [L45] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=50] [L45] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L50] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L52] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L52] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L53] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L54] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L58] signed long int stepLocal_1 = -4; [L59] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L60] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L65] var_1_18 = var_1_17 [L66] var_1_19 = 0 [L67] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L68] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L71] COND TRUE var_1_3 <= var_1_1 [L72] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L76] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32768, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L77] COND TRUE (~ var_1_3) < stepLocal_2 [L78] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L129] RET step() [L130] CALL, EXPR property() [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L119] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L119] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L119-L120] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=-126, var_1_6=50, var_1_7=27, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.5s, OverallIterations: 18, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2436 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2436 mSDsluCounter, 7992 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5977 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5714 IncrementalHoareTripleChecker+Invalid, 6033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 2015 mSDtfsCounter, 5714 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 969 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=16, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 1438 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 31.4s InterpolantComputationTime, 2836 NumberOfCodeBlocks, 2836 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2517 ConstructedInterpolants, 0 QuantifiedInterpolants, 17402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 15708/15708 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-10 07:52:47,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.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 e16c5a025919373f7b296a1dca27c9a462a1ec91557da14151f7e36b86babe44 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:52:49,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:52:49,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:52:49,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:52:49,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:52:49,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:52:49,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:52:49,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:52:49,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:52:49,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:52:49,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:52:49,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:52:49,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:52:49,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:52:49,509 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:52:49,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:52:49,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:52:49,510 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:52:49,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:52:49,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:52:49,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:52:49,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:52:49,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:52:49,515 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:52:49,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:52:49,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:52:49,516 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:52:49,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:52:49,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:52:49,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:52:49,517 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:52:49,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:52:49,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:52:49,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:52:49,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:52:49,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:52:49,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:52:49,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:52:49,521 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:52:49,521 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:52:49,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:52:49,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:52:49,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:52:49,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:52:49,522 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 -> e16c5a025919373f7b296a1dca27c9a462a1ec91557da14151f7e36b86babe44 [2024-11-10 07:52:49,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:52:49,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:52:49,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:52:49,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:52:49,918 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:52:49,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i [2024-11-10 07:52:51,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:52:51,903 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:52:51,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i [2024-11-10 07:52:51,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf278261/ef099d77745f4e5581fbf38f5c58ffbd/FLAGa60927b7e [2024-11-10 07:52:51,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf278261/ef099d77745f4e5581fbf38f5c58ffbd [2024-11-10 07:52:51,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:52:51,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:52:51,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:52:51,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:52:51,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:52:51,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:52:51" (1/1) ... [2024-11-10 07:52:51,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290165e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:51, skipping insertion in model container [2024-11-10 07:52:51,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:52:51" (1/1) ... [2024-11-10 07:52:51,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:52:52,172 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_50-1loop_file-84.i[915,928] [2024-11-10 07:52:52,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:52:52,279 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:52:52,294 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_50-1loop_file-84.i[915,928] [2024-11-10 07:52:52,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:52:52,357 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:52:52,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52 WrapperNode [2024-11-10 07:52:52,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:52:52,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:52:52,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:52:52,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:52:52,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (1/1) ... [2024-11-10 07:52:52,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (1/1) ... [2024-11-10 07:52:52,414 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-10 07:52:52,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:52:52,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:52:52,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:52:52,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:52:52,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (1/1) ... [2024-11-10 07:52:52,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (1/1) ... [2024-11-10 07:52:52,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (1/1) ... [2024-11-10 07:52:52,454 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-10 07:52:52,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (1/1) ... [2024-11-10 07:52:52,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (1/1) ... [2024-11-10 07:52:52,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (1/1) ... [2024-11-10 07:52:52,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (1/1) ... [2024-11-10 07:52:52,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (1/1) ... [2024-11-10 07:52:52,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (1/1) ... [2024-11-10 07:52:52,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:52:52,487 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:52:52,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:52:52,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:52:52,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (1/1) ... [2024-11-10 07:52:52,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:52:52,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:52:52,525 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-10 07:52:52,547 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-10 07:52:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:52:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:52:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:52:52,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:52:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:52:52,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:52:52,701 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:52:52,703 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:52:53,285 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 07:52:53,285 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:52:53,298 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:52:53,298 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:52:53,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:52:53 BoogieIcfgContainer [2024-11-10 07:52:53,299 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:52:53,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:52:53,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:52:53,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:52:53,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:52:51" (1/3) ... [2024-11-10 07:52:53,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4314c7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:52:53, skipping insertion in model container [2024-11-10 07:52:53,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:52" (2/3) ... [2024-11-10 07:52:53,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4314c7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:52:53, skipping insertion in model container [2024-11-10 07:52:53,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:52:53" (3/3) ... [2024-11-10 07:52:53,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-84.i [2024-11-10 07:52:53,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:52:53,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:52:53,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:52:53,419 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;@24db73e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:52:53,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:52:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 07:52:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 07:52:53,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:53,439 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:53,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:53,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash -707624101, now seen corresponding path program 1 times [2024-11-10 07:52:53,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:52:53,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150896924] [2024-11-10 07:52:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:53,461 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-10 07:52:53,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:52:53,464 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-10 07:52:53,501 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-10 07:52:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:53,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:52:53,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:52:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2024-11-10 07:52:53,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:52:53,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:52:53,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150896924] [2024-11-10 07:52:53,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150896924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:53,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:53,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:52:53,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615298795] [2024-11-10 07:52:53,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:53,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:52:53,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:52:53,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:52:53,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:52:53,831 INFO L87 Difference]: Start difference. First operand has 66 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 07:52:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:53,857 INFO L93 Difference]: Finished difference Result 128 states and 214 transitions. [2024-11-10 07:52:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:52:53,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2024-11-10 07:52:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:53,867 INFO L225 Difference]: With dead ends: 128 [2024-11-10 07:52:53,868 INFO L226 Difference]: Without dead ends: 61 [2024-11-10 07:52:53,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-10 07:52:53,875 INFO L432 NwaCegarLoop]: 94 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, 94 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-10 07:52:53,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:52:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-10 07:52:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-10 07:52:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 07:52:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2024-11-10 07:52:53,922 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 90 transitions. Word has length 141 [2024-11-10 07:52:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:53,923 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 90 transitions. [2024-11-10 07:52:53,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 07:52:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 90 transitions. [2024-11-10 07:52:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 07:52:53,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:53,929 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:53,938 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-10 07:52:54,130 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-10 07:52:54,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:54,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash -909551557, now seen corresponding path program 1 times [2024-11-10 07:52:54,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:52:54,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89019818] [2024-11-10 07:52:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:54,132 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-10 07:52:54,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:52:54,135 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-10 07:52:54,137 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-10 07:52:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:54,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 07:52:54,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:52:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 07:52:54,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:52:54,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:52:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89019818] [2024-11-10 07:52:54,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89019818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:52:54,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:52:54,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:52:54,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286044792] [2024-11-10 07:52:54,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:52:54,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:52:54,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:52:54,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:52:54,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:52:54,428 INFO L87 Difference]: Start difference. First operand 61 states and 90 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:52:54,536 INFO L93 Difference]: Finished difference Result 119 states and 177 transitions. [2024-11-10 07:52:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:52:54,546 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-11-10 07:52:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:52:54,549 INFO L225 Difference]: With dead ends: 119 [2024-11-10 07:52:54,549 INFO L226 Difference]: Without dead ends: 61 [2024-11-10 07:52:54,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 139 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-10 07:52:54,551 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:52:54,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 87 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:52:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-10 07:52:54,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-10 07:52:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 07:52:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2024-11-10 07:52:54,568 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 141 [2024-11-10 07:52:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:52:54,570 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2024-11-10 07:52:54,571 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 07:52:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2024-11-10 07:52:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 07:52:54,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:52:54,573 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:52:54,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 07:52:54,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:52:54,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:52:54,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:52:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1577961276, now seen corresponding path program 1 times [2024-11-10 07:52:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:52:54,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47508141] [2024-11-10 07:52:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:52:54,777 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-10 07:52:54,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:52:54,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:52:54,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 07:52:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:52:54,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 07:52:55,014 INFO L278 TraceCheckSpWp]: Computing forward predicates...