./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.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 d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:56:24,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:56:24,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:56:24,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:56:24,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:56:24,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:56:24,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:56:24,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:56:24,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:56:24,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:56:24,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:56:24,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:56:24,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:56:24,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:56:24,816 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:56:24,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:56:24,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:56:24,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:56:24,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:56:24,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:56:24,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:56:24,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:56:24,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:56:24,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:56:24,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:56:24,825 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:56:24,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:56:24,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:56:24,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:56:24,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:56:24,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:56:24,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:56:24,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:56:24,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:56:24,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:56:24,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:56:24,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:56:24,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:56:24,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:56:24,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:56:24,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:56:24,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:56:24,828 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 -> d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d [2024-11-20 02:56:25,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:56:25,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:56:25,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:56:25,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:56:25,033 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:56:25,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i [2024-11-20 02:56:26,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:56:26,409 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:56:26,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i [2024-11-20 02:56:26,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd84f1e8/8b8afaa44cb04e189b3683aab2d5b157/FLAG18418b74b [2024-11-20 02:56:26,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd84f1e8/8b8afaa44cb04e189b3683aab2d5b157 [2024-11-20 02:56:26,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:56:26,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:56:26,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:56:26,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:56:26,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:56:26,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709792c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26, skipping insertion in model container [2024-11-20 02:56:26,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:56:26,599 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_fillercode_fillercodesize_normal_file-9.i[912,925] [2024-11-20 02:56:26,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:56:26,653 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:56:26,662 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_fillercode_fillercodesize_normal_file-9.i[912,925] [2024-11-20 02:56:26,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:56:26,696 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:56:26,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26 WrapperNode [2024-11-20 02:56:26,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:56:26,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:56:26,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:56:26,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:56:26,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,750 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-11-20 02:56:26,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:56:26,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:56:26,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:56:26,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:56:26,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,773 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:56:26,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:56:26,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:56:26,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:56:26,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:56:26,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (1/1) ... [2024-11-20 02:56:26,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:56:26,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:56:26,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:56:26,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:56:26,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:56:26,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:56:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:56:26,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:56:26,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:56:26,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:56:26,980 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:56:26,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:56:27,221 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-20 02:56:27,221 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:56:27,231 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:56:27,231 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:56:27,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:27 BoogieIcfgContainer [2024-11-20 02:56:27,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:56:27,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:56:27,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:56:27,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:56:27,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:56:26" (1/3) ... [2024-11-20 02:56:27,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf13ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:27, skipping insertion in model container [2024-11-20 02:56:27,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:26" (2/3) ... [2024-11-20 02:56:27,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf13ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:27, skipping insertion in model container [2024-11-20 02:56:27,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:27" (3/3) ... [2024-11-20 02:56:27,238 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-9.i [2024-11-20 02:56:27,251 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:56:27,252 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:56:27,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:56:27,299 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;@46c7f2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:56:27,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:56:27,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 02:56:27,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:27,310 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:27,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:27,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:27,314 INFO L85 PathProgramCache]: Analyzing trace with hash 255444505, now seen corresponding path program 1 times [2024-11-20 02:56:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:27,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320444273] [2024-11-20 02:56:27,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:27,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:27,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320444273] [2024-11-20 02:56:27,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320444273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:27,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:27,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:56:27,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189134263] [2024-11-20 02:56:27,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:27,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:56:27,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:27,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:56:27,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:56:27,621 INFO L87 Difference]: Start difference. First operand has 74 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 02:56:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:27,639 INFO L93 Difference]: Finished difference Result 141 states and 227 transitions. [2024-11-20 02:56:27,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:56:27,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-20 02:56:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:27,646 INFO L225 Difference]: With dead ends: 141 [2024-11-20 02:56:27,646 INFO L226 Difference]: Without dead ends: 70 [2024-11-20 02:56:27,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:56:27,651 INFO L432 NwaCegarLoop]: 102 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, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:27,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:56:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-20 02:56:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-20 02:56:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-11-20 02:56:27,680 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 108 [2024-11-20 02:56:27,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:27,681 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-11-20 02:56:27,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 02:56:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-11-20 02:56:27,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 02:56:27,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:27,683 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:27,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:56:27,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:27,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash -878433837, now seen corresponding path program 1 times [2024-11-20 02:56:27,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:27,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563543821] [2024-11-20 02:56:27,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:27,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:27,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563543821] [2024-11-20 02:56:27,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563543821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:27,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:27,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:56:27,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345980106] [2024-11-20 02:56:27,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:27,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:56:27,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:27,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:56:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:56:27,916 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:27,938 INFO L93 Difference]: Finished difference Result 138 states and 203 transitions. [2024-11-20 02:56:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:56:27,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-20 02:56:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:27,941 INFO L225 Difference]: With dead ends: 138 [2024-11-20 02:56:27,941 INFO L226 Difference]: Without dead ends: 71 [2024-11-20 02:56:27,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:56:27,943 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:27,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:56:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-20 02:56:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-20 02:56:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2024-11-20 02:56:27,950 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 108 [2024-11-20 02:56:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:27,952 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2024-11-20 02:56:27,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-11-20 02:56:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 02:56:27,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:27,957 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:27,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:56:27,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:27,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1398780630, now seen corresponding path program 1 times [2024-11-20 02:56:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:27,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388370216] [2024-11-20 02:56:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:27,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:30,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:30,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388370216] [2024-11-20 02:56:30,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388370216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:30,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:30,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 02:56:30,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755356424] [2024-11-20 02:56:30,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:30,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:56:30,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:30,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:56:30,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:56:30,779 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 02:56:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:32,535 INFO L93 Difference]: Finished difference Result 249 states and 360 transitions. [2024-11-20 02:56:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:56:32,536 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2024-11-20 02:56:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:32,539 INFO L225 Difference]: With dead ends: 249 [2024-11-20 02:56:32,539 INFO L226 Difference]: Without dead ends: 181 [2024-11-20 02:56:32,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-20 02:56:32,542 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 594 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:32,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 301 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 02:56:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-20 02:56:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 97. [2024-11-20 02:56:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-20 02:56:32,553 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-20 02:56:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:32,554 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-20 02:56:32,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 02:56:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-20 02:56:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 02:56:32,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:32,556 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:32,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:56:32,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:32,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:32,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1875118312, now seen corresponding path program 1 times [2024-11-20 02:56:32,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:32,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461429335] [2024-11-20 02:56:32,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:32,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:34,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:34,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461429335] [2024-11-20 02:56:34,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461429335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:34,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:34,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 02:56:34,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15226196] [2024-11-20 02:56:34,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:34,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:56:34,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:34,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:56:34,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:56:34,418 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:35,134 INFO L93 Difference]: Finished difference Result 262 states and 384 transitions. [2024-11-20 02:56:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 02:56:35,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-20 02:56:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:35,136 INFO L225 Difference]: With dead ends: 262 [2024-11-20 02:56:35,136 INFO L226 Difference]: Without dead ends: 168 [2024-11-20 02:56:35,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:56:35,140 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 134 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:35,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 358 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 02:56:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-20 02:56:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 97. [2024-11-20 02:56:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-20 02:56:35,156 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-20 02:56:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:35,157 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-20 02:56:35,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-20 02:56:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 02:56:35,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:35,161 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:35,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:56:35,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:35,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1207242924, now seen corresponding path program 1 times [2024-11-20 02:56:35,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:35,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211317257] [2024-11-20 02:56:35,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:35,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:37,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:37,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211317257] [2024-11-20 02:56:37,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211317257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:37,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:37,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 02:56:37,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222010727] [2024-11-20 02:56:37,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:37,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:56:37,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:56:37,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:56:37,235 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 02:56:39,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:39,248 INFO L93 Difference]: Finished difference Result 277 states and 402 transitions. [2024-11-20 02:56:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:56:39,249 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2024-11-20 02:56:39,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:39,250 INFO L225 Difference]: With dead ends: 277 [2024-11-20 02:56:39,250 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 02:56:39,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-20 02:56:39,252 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 438 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:39,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 366 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 02:56:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 02:56:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 102. [2024-11-20 02:56:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.423529411764706) internal successors, (121), 85 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2024-11-20 02:56:39,265 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 109 [2024-11-20 02:56:39,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:39,265 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2024-11-20 02:56:39,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-20 02:56:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2024-11-20 02:56:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 02:56:39,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:39,267 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:39,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:56:39,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:39,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:39,267 INFO L85 PathProgramCache]: Analyzing trace with hash 186174570, now seen corresponding path program 1 times [2024-11-20 02:56:39,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:39,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211496742] [2024-11-20 02:56:39,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:39,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:40,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:40,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211496742] [2024-11-20 02:56:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211496742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:40,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 02:56:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623996529] [2024-11-20 02:56:40,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:40,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:56:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:40,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:56:40,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:56:40,835 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:42,171 INFO L93 Difference]: Finished difference Result 269 states and 394 transitions. [2024-11-20 02:56:42,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 02:56:42,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-20 02:56:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:42,174 INFO L225 Difference]: With dead ends: 269 [2024-11-20 02:56:42,174 INFO L226 Difference]: Without dead ends: 170 [2024-11-20 02:56:42,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:56:42,175 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 93 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:42,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 452 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 02:56:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-20 02:56:42,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 97. [2024-11-20 02:56:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-20 02:56:42,187 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-20 02:56:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:42,188 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-20 02:56:42,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-20 02:56:42,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 02:56:42,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:42,192 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:42,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 02:56:42,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:42,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash -976078804, now seen corresponding path program 1 times [2024-11-20 02:56:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:42,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455241945] [2024-11-20 02:56:42,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:42,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:42,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:42,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455241945] [2024-11-20 02:56:42,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455241945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:42,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:42,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 02:56:42,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186577149] [2024-11-20 02:56:42,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:42,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:56:42,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:42,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:56:42,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:56:42,997 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:43,328 INFO L93 Difference]: Finished difference Result 255 states and 377 transitions. [2024-11-20 02:56:43,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 02:56:43,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-20 02:56:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:43,330 INFO L225 Difference]: With dead ends: 255 [2024-11-20 02:56:43,330 INFO L226 Difference]: Without dead ends: 161 [2024-11-20 02:56:43,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:56:43,331 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 125 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:43,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 270 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 02:56:43,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-20 02:56:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 97. [2024-11-20 02:56:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-20 02:56:43,338 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-20 02:56:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:43,338 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-20 02:56:43,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-20 02:56:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 02:56:43,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:43,339 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:43,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 02:56:43,340 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:43,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1629944750, now seen corresponding path program 1 times [2024-11-20 02:56:43,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:43,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644860245] [2024-11-20 02:56:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:44,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:44,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644860245] [2024-11-20 02:56:44,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644860245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:44,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:44,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 02:56:44,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3762795] [2024-11-20 02:56:44,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:44,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:56:44,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:44,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:56:44,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:56:44,133 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:44,617 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2024-11-20 02:56:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 02:56:44,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-20 02:56:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:44,618 INFO L225 Difference]: With dead ends: 233 [2024-11-20 02:56:44,618 INFO L226 Difference]: Without dead ends: 139 [2024-11-20 02:56:44,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:56:44,619 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 134 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:44,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 426 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 02:56:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-20 02:56:44,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 73. [2024-11-20 02:56:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions. [2024-11-20 02:56:44,624 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 109 [2024-11-20 02:56:44,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:44,624 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 105 transitions. [2024-11-20 02:56:44,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions. [2024-11-20 02:56:44,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 02:56:44,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:44,625 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:44,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 02:56:44,626 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:44,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash -451875899, now seen corresponding path program 1 times [2024-11-20 02:56:44,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:44,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624162112] [2024-11-20 02:56:44,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:44,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 02:56:44,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:44,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624162112] [2024-11-20 02:56:44,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624162112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:56:44,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012811357] [2024-11-20 02:56:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:44,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:56:44,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:56:44,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:56:44,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 02:56:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:44,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 02:56:44,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:56:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-20 02:56:45,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:56:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 02:56:45,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012811357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:56:45,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 02:56:45,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-20 02:56:45,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346837863] [2024-11-20 02:56:45,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 02:56:45,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:56:45,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:45,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:56:45,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:56:45,130 INFO L87 Difference]: Start difference. First operand 73 states and 105 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-20 02:56:45,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:45,269 INFO L93 Difference]: Finished difference Result 153 states and 215 transitions. [2024-11-20 02:56:45,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 02:56:45,269 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 111 [2024-11-20 02:56:45,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:45,270 INFO L225 Difference]: With dead ends: 153 [2024-11-20 02:56:45,271 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 02:56:45,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:56:45,271 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 213 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:45,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 172 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:56:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 02:56:45,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-20 02:56:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2024-11-20 02:56:45,277 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 111 [2024-11-20 02:56:45,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:45,278 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2024-11-20 02:56:45,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-20 02:56:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2024-11-20 02:56:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 02:56:45,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:45,279 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:45,293 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-20 02:56:45,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:56:45,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:45,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1848946691, now seen corresponding path program 1 times [2024-11-20 02:56:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:45,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104996310] [2024-11-20 02:56:45,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:56:45,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143517999] [2024-11-20 02:56:45,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:45,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:56:45,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:56:45,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:56:45,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 02:56:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:45,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 02:56:45,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:56:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-20 02:56:45,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:56:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 02:56:46,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:46,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104996310] [2024-11-20 02:56:46,195 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 02:56:46,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143517999] [2024-11-20 02:56:46,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143517999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:56:46,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:56:46,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 02:56:46,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441527337] [2024-11-20 02:56:46,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:56:46,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 02:56:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 02:56:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:56:46,197 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-20 02:56:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:46,779 INFO L93 Difference]: Finished difference Result 251 states and 330 transitions. [2024-11-20 02:56:46,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 02:56:46,780 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 111 [2024-11-20 02:56:46,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:46,781 INFO L225 Difference]: With dead ends: 251 [2024-11-20 02:56:46,781 INFO L226 Difference]: Without dead ends: 173 [2024-11-20 02:56:46,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-20 02:56:46,782 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 228 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:46,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 829 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 02:56:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-20 02:56:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 120. [2024-11-20 02:56:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 162 transitions. [2024-11-20 02:56:46,789 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 162 transitions. Word has length 111 [2024-11-20 02:56:46,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:46,789 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 162 transitions. [2024-11-20 02:56:46,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-20 02:56:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 162 transitions. [2024-11-20 02:56:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 02:56:46,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:46,790 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:46,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 02:56:46,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 02:56:46,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:46,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:46,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1417968666, now seen corresponding path program 1 times [2024-11-20 02:56:46,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:46,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915752094] [2024-11-20 02:56:46,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:46,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:47,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:47,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915752094] [2024-11-20 02:56:47,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915752094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:47,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:47,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:56:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387869873] [2024-11-20 02:56:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:47,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:56:47,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:56:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:56:47,041 INFO L87 Difference]: Start difference. First operand 120 states and 162 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:47,072 INFO L93 Difference]: Finished difference Result 288 states and 385 transitions. [2024-11-20 02:56:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:56:47,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-20 02:56:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:47,073 INFO L225 Difference]: With dead ends: 288 [2024-11-20 02:56:47,073 INFO L226 Difference]: Without dead ends: 171 [2024-11-20 02:56:47,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:56:47,074 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 82 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:47,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 192 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:56:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-20 02:56:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 120. [2024-11-20 02:56:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:56:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 161 transitions. [2024-11-20 02:56:47,081 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 161 transitions. Word has length 111 [2024-11-20 02:56:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:47,082 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 161 transitions. [2024-11-20 02:56:47,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions. [2024-11-20 02:56:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 02:56:47,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:47,083 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:47,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 02:56:47,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:47,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:47,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1719733946, now seen corresponding path program 1 times [2024-11-20 02:56:47,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:47,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098968293] [2024-11-20 02:56:47,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:47,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:47,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:47,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098968293] [2024-11-20 02:56:47,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098968293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:47,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:47,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 02:56:47,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674662690] [2024-11-20 02:56:47,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:47,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:56:47,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:47,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:56:47,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:56:47,557 INFO L87 Difference]: Start difference. First operand 120 states and 161 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:47,938 INFO L93 Difference]: Finished difference Result 479 states and 631 transitions. [2024-11-20 02:56:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 02:56:47,939 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-20 02:56:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:47,940 INFO L225 Difference]: With dead ends: 479 [2024-11-20 02:56:47,940 INFO L226 Difference]: Without dead ends: 362 [2024-11-20 02:56:47,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:56:47,941 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 191 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:47,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 471 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 02:56:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-20 02:56:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 239. [2024-11-20 02:56:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 204 states have (on average 1.3235294117647058) internal successors, (270), 205 states have internal predecessors, (270), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 02:56:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 322 transitions. [2024-11-20 02:56:47,962 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 322 transitions. Word has length 111 [2024-11-20 02:56:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:47,963 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 322 transitions. [2024-11-20 02:56:47,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 322 transitions. [2024-11-20 02:56:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 02:56:47,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:47,965 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:47,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 02:56:47,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:47,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:47,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2142435772, now seen corresponding path program 1 times [2024-11-20 02:56:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:47,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087517501] [2024-11-20 02:56:47,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:47,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:48,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087517501] [2024-11-20 02:56:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087517501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:48,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:48,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 02:56:48,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934971539] [2024-11-20 02:56:48,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:48,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 02:56:48,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:48,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 02:56:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:56:48,185 INFO L87 Difference]: Start difference. First operand 239 states and 322 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:48,447 INFO L93 Difference]: Finished difference Result 695 states and 916 transitions. [2024-11-20 02:56:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 02:56:48,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-20 02:56:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:48,450 INFO L225 Difference]: With dead ends: 695 [2024-11-20 02:56:48,450 INFO L226 Difference]: Without dead ends: 459 [2024-11-20 02:56:48,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:56:48,451 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 139 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:48,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 546 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:56:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-20 02:56:48,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 246. [2024-11-20 02:56:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 211 states have (on average 1.3270142180094786) internal successors, (280), 212 states have internal predecessors, (280), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 02:56:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 332 transitions. [2024-11-20 02:56:48,470 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 332 transitions. Word has length 111 [2024-11-20 02:56:48,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:48,470 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 332 transitions. [2024-11-20 02:56:48,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 332 transitions. [2024-11-20 02:56:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 02:56:48,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:48,471 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:48,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 02:56:48,471 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:48,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1485993431, now seen corresponding path program 1 times [2024-11-20 02:56:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:48,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768770696] [2024-11-20 02:56:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:48,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:50,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:50,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768770696] [2024-11-20 02:56:50,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768770696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:50,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:50,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 02:56:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112376588] [2024-11-20 02:56:50,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:50,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 02:56:50,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:50,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 02:56:50,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:56:50,416 INFO L87 Difference]: Start difference. First operand 246 states and 332 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:53,916 INFO L93 Difference]: Finished difference Result 562 states and 749 transitions. [2024-11-20 02:56:53,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 02:56:53,917 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-20 02:56:53,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:53,918 INFO L225 Difference]: With dead ends: 562 [2024-11-20 02:56:53,918 INFO L226 Difference]: Without dead ends: 319 [2024-11-20 02:56:53,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2024-11-20 02:56:53,920 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 381 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:53,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 758 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 02:56:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-20 02:56:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 276. [2024-11-20 02:56:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 241 states have (on average 1.3319502074688796) internal successors, (321), 242 states have internal predecessors, (321), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 02:56:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 373 transitions. [2024-11-20 02:56:53,939 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 373 transitions. Word has length 112 [2024-11-20 02:56:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:53,939 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 373 transitions. [2024-11-20 02:56:53,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 373 transitions. [2024-11-20 02:56:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 02:56:53,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:53,940 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:53,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 02:56:53,941 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:53,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:53,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1787758711, now seen corresponding path program 1 times [2024-11-20 02:56:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:53,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870134563] [2024-11-20 02:56:53,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:53,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:56:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:56:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:56:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:56:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:56:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:56:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:56:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:56:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:56:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:56:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:56:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 02:56:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:56:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 02:56:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:56:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:56:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:56:54,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:56:54,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870134563] [2024-11-20 02:56:54,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870134563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:56:54,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:56:54,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 02:56:54,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598087522] [2024-11-20 02:56:54,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:56:54,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 02:56:54,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:56:54,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 02:56:54,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:56:54,141 INFO L87 Difference]: Start difference. First operand 276 states and 373 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:56:54,411 INFO L93 Difference]: Finished difference Result 813 states and 1094 transitions. [2024-11-20 02:56:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 02:56:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-20 02:56:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:56:54,415 INFO L225 Difference]: With dead ends: 813 [2024-11-20 02:56:54,416 INFO L226 Difference]: Without dead ends: 540 [2024-11-20 02:56:54,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:56:54,416 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 111 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:56:54,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 638 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:56:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-20 02:56:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 448. [2024-11-20 02:56:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 379 states have (on average 1.2955145118733509) internal successors, (491), 381 states have internal predecessors, (491), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 02:56:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 595 transitions. [2024-11-20 02:56:54,446 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 595 transitions. Word has length 112 [2024-11-20 02:56:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:56:54,446 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 595 transitions. [2024-11-20 02:56:54,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:56:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 595 transitions. [2024-11-20 02:56:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-20 02:56:54,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:56:54,447 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:54,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 02:56:54,448 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:56:54,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:56:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1573618992, now seen corresponding path program 1 times [2024-11-20 02:56:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:56:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590579272] [2024-11-20 02:56:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:56:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:56:54,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113178310] [2024-11-20 02:56:54,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:56:54,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:56:54,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:56:54,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:56:54,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 02:56:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:56:55,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:56:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:56:55,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:56:55,276 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:56:55,277 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:56:55,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 02:56:55,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:56:55,481 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:56:55,541 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:56:55,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:56:55 BoogieIcfgContainer [2024-11-20 02:56:55,543 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:56:55,543 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:56:55,543 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:56:55,543 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:56:55,543 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:27" (3/4) ... [2024-11-20 02:56:55,545 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:56:55,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:56:55,546 INFO L158 Benchmark]: Toolchain (without parser) took 29109.92ms. Allocated memory was 186.6MB in the beginning and 371.2MB in the end (delta: 184.5MB). Free memory was 119.4MB in the beginning and 302.6MB in the end (delta: -183.3MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-11-20 02:56:55,546 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:56:55,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.49ms. Allocated memory is still 186.6MB. Free memory was 119.2MB in the beginning and 103.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 02:56:55,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.53ms. Allocated memory is still 186.6MB. Free memory was 103.5MB in the beginning and 100.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 02:56:55,547 INFO L158 Benchmark]: Boogie Preprocessor took 39.89ms. Allocated memory is still 186.6MB. Free memory was 100.5MB in the beginning and 97.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:56:55,547 INFO L158 Benchmark]: RCFGBuilder took 439.87ms. Allocated memory is still 186.6MB. Free memory was 97.1MB in the beginning and 137.9MB in the end (delta: -40.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 02:56:55,547 INFO L158 Benchmark]: TraceAbstraction took 28309.46ms. Allocated memory was 186.6MB in the beginning and 371.2MB in the end (delta: 184.5MB). Free memory was 137.2MB in the beginning and 303.7MB in the end (delta: -166.5MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-11-20 02:56:55,547 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 371.2MB. Free memory was 303.7MB in the beginning and 302.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:56:55,548 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.12ms. Allocated memory is still 117.4MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.49ms. Allocated memory is still 186.6MB. Free memory was 119.2MB in the beginning and 103.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.53ms. Allocated memory is still 186.6MB. Free memory was 103.5MB in the beginning and 100.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.89ms. Allocated memory is still 186.6MB. Free memory was 100.5MB in the beginning and 97.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 439.87ms. Allocated memory is still 186.6MB. Free memory was 97.1MB in the beginning and 137.9MB in the end (delta: -40.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 28309.46ms. Allocated memory was 186.6MB in the beginning and 371.2MB in the end (delta: 184.5MB). Free memory was 137.2MB in the beginning and 303.7MB in the end (delta: -166.5MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 371.2MB. Free memory was 303.7MB in the beginning and 302.6MB in the end (delta: 1.0MB). 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, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L127] RET updateVariables() [L128] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L60] var_1_18 = var_1_3 [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=8, stepLocal_4=8, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=8, var_1_11=8, var_1_12=8, var_1_13=8, var_1_15=1, var_1_16=8, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=10, var_1_6=8, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.2s, OverallIterations: 16, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2869 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2863 mSDsluCounter, 6078 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4488 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4526 IncrementalHoareTripleChecker+Invalid, 4605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 1590 mSDtfsCounter, 4526 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1046 GetRequests, 903 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=448occurred in iteration=15, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 1016 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 2095 NumberOfCodeBlocks, 2095 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1964 ConstructedInterpolants, 0 QuantifiedInterpolants, 10485 SizeOfPredicates, 9 NumberOfNonLiveVariables, 548 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 7374/7560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 02:56:55,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.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 d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:56:57,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:56:57,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:56:57,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:56:57,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:56:57,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:56:57,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:56:57,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:56:57,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:56:57,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:56:57,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:56:57,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:56:57,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:56:57,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:56:57,394 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:56:57,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:56:57,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:56:57,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:56:57,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:56:57,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:56:57,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:56:57,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:56:57,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:56:57,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:56:57,397 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:56:57,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:56:57,397 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:56:57,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:56:57,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:56:57,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:56:57,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:56:57,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:56:57,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:56:57,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:56:57,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:56:57,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:56:57,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:56:57,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:56:57,400 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:56:57,400 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:56:57,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:56:57,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:56:57,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:56:57,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:56:57,401 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 -> d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d [2024-11-20 02:56:57,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:56:57,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:56:57,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:56:57,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:56:57,666 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:56:57,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i [2024-11-20 02:56:58,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:56:59,072 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:56:59,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i [2024-11-20 02:56:59,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d024664/5ec4b5f0bad84c8baab88b6b8be9af46/FLAG3ae9429e1 [2024-11-20 02:56:59,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d024664/5ec4b5f0bad84c8baab88b6b8be9af46 [2024-11-20 02:56:59,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:56:59,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:56:59,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:56:59,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:56:59,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:56:59,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc21f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59, skipping insertion in model container [2024-11-20 02:56:59,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:56:59,276 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_fillercode_fillercodesize_normal_file-9.i[912,925] [2024-11-20 02:56:59,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:56:59,350 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:56:59,360 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_fillercode_fillercodesize_normal_file-9.i[912,925] [2024-11-20 02:56:59,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:56:59,406 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:56:59,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59 WrapperNode [2024-11-20 02:56:59,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:56:59,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:56:59,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:56:59,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:56:59,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,458 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-20 02:56:59,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:56:59,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:56:59,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:56:59,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:56:59,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,480 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:56:59,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,486 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:56:59,494 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:56:59,494 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:56:59,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:56:59,495 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (1/1) ... [2024-11-20 02:56:59,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:56:59,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:56:59,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:56:59,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:56:59,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:56:59,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:56:59,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:56:59,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:56:59,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:56:59,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:56:59,618 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:56:59,621 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:56:59,927 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 02:56:59,928 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:56:59,940 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:56:59,941 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:56:59,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:59 BoogieIcfgContainer [2024-11-20 02:56:59,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:56:59,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:56:59,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:56:59,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:56:59,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:56:59" (1/3) ... [2024-11-20 02:56:59,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2859888a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:59, skipping insertion in model container [2024-11-20 02:56:59,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:56:59" (2/3) ... [2024-11-20 02:56:59,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2859888a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:56:59, skipping insertion in model container [2024-11-20 02:56:59,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:56:59" (3/3) ... [2024-11-20 02:56:59,949 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-9.i [2024-11-20 02:56:59,977 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:56:59,977 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:57:00,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:57:00,041 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;@6cfd0257, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:57:00,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:57:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:57:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 02:57:00,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:57:00,053 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:57:00,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:57:00,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:57:00,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1232252901, now seen corresponding path program 1 times [2024-11-20 02:57:00,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:57:00,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633880303] [2024-11-20 02:57:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:57:00,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:57:00,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:57:00,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:57:00,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 02:57:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:00,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:57:00,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:57:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 02:57:00,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:57:00,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:57:00,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633880303] [2024-11-20 02:57:00,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633880303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:57:00,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:57:00,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:57:00,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672171459] [2024-11-20 02:57:00,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:57:00,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:57:00,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:57:00,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:57:00,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:57:00,319 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:57:00,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:57:00,350 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-20 02:57:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:57:00,352 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-11-20 02:57:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:57:00,359 INFO L225 Difference]: With dead ends: 103 [2024-11-20 02:57:00,360 INFO L226 Difference]: Without dead ends: 51 [2024-11-20 02:57:00,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:57:00,367 INFO L432 NwaCegarLoop]: 74 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, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:57:00,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:57:00,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-20 02:57:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-20 02:57:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-20 02:57:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-20 02:57:00,402 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 100 [2024-11-20 02:57:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:57:00,403 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-20 02:57:00,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-20 02:57:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-20 02:57:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 02:57:00,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:57:00,406 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:57:00,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 02:57:00,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:57:00,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:57:00,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:57:00,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1657719433, now seen corresponding path program 1 times [2024-11-20 02:57:00,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:57:00,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752650474] [2024-11-20 02:57:00,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:57:00,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:57:00,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:57:00,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:57:00,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 02:57:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:00,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-20 02:57:00,797 INFO L278 TraceCheckSpWp]: Computing forward predicates...