./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_operatoramount_amount10_file-60.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_operatoramount_amount10_file-60.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 e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:27:53,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:27:53,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:27:53,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:27:53,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:27:53,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:27:53,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:27:53,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:27:53,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:27:53,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:27:53,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:27:53,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:27:53,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:27:53,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:27:53,985 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:27:53,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:27:53,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:27:53,986 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:27:53,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:27:53,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:27:53,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:27:53,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:27:53,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:27:53,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:27:53,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:27:53,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:27:53,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:27:53,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:27:53,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:27:53,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:27:53,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:27:53,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:27:53,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:27:53,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:27:53,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:27:53,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:27:53,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:27:53,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:27:53,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:27:53,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:27:53,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:27:53,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:27:53,994 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 -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2024-11-20 07:27:54,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:27:54,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:27:54,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:27:54,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:27:54,281 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:27:54,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-11-20 07:27:55,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:27:55,951 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:27:55,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-11-20 07:27:55,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfc0e3a3/6e8e6ba37cfa4d85a3237551c4f0ec0d/FLAG261c37052 [2024-11-20 07:27:56,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfc0e3a3/6e8e6ba37cfa4d85a3237551c4f0ec0d [2024-11-20 07:27:56,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:27:56,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:27:56,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:27:56,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:27:56,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:27:56,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159043e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56, skipping insertion in model container [2024-11-20 07:27:56,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:27:56,575 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_operatoramount_amount10_file-60.i[915,928] [2024-11-20 07:27:56,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:27:56,641 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:27:56,655 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_operatoramount_amount10_file-60.i[915,928] [2024-11-20 07:27:56,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:27:56,691 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:27:56,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56 WrapperNode [2024-11-20 07:27:56,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:27:56,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:27:56,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:27:56,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:27:56,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,735 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-20 07:27:56,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:27:56,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:27:56,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:27:56,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:27:56,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,782 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 07:27:56,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:27:56,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:27:56,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:27:56,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:27:56,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (1/1) ... [2024-11-20 07:27:56,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:27:56,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:27:56,847 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 07:27:56,859 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 07:27:56,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:27:56,904 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:27:56,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:27:56,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:27:56,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:27:56,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:27:56,968 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:27:56,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:27:57,155 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 07:27:57,156 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:27:57,168 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:27:57,168 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:27:57,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:27:57 BoogieIcfgContainer [2024-11-20 07:27:57,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:27:57,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:27:57,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:27:57,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:27:57,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:27:56" (1/3) ... [2024-11-20 07:27:57,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660f2a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:27:57, skipping insertion in model container [2024-11-20 07:27:57,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:56" (2/3) ... [2024-11-20 07:27:57,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660f2a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:27:57, skipping insertion in model container [2024-11-20 07:27:57,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:27:57" (3/3) ... [2024-11-20 07:27:57,178 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2024-11-20 07:27:57,196 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:27:57,196 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:27:57,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:27:57,280 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;@2eb3e7c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:27:57,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:27:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 07:27:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 07:27:57,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:57,298 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:57,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:57,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:57,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1891837795, now seen corresponding path program 1 times [2024-11-20 07:27:57,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:27:57,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932741055] [2024-11-20 07:27:57,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:57,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:27:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:27:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:27:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:27:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:27:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:27:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:27:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:27:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:27:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:27:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:27:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:27:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:27:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:27:57,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:27:57,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932741055] [2024-11-20 07:27:57,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932741055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:27:57,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:27:57,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:27:57,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602722699] [2024-11-20 07:27:57,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:27:57,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:27:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:27:57,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:27:57,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:27:57,709 INFO L87 Difference]: Start difference. First operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 07:27:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:27:57,733 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2024-11-20 07:27:57,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:27:57,735 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2024-11-20 07:27:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:27:57,745 INFO L225 Difference]: With dead ends: 95 [2024-11-20 07:27:57,745 INFO L226 Difference]: Without dead ends: 47 [2024-11-20 07:27:57,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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 07:27:57,754 INFO L432 NwaCegarLoop]: 65 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, 65 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 07:27:57,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:27:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-20 07:27:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-20 07:27:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 07:27:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-20 07:27:57,797 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 81 [2024-11-20 07:27:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:27:57,798 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-20 07:27:57,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 07:27:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-20 07:27:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 07:27:57,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:57,802 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:57,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:27:57,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:57,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:57,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1491710109, now seen corresponding path program 1 times [2024-11-20 07:27:57,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:27:57,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163395421] [2024-11-20 07:27:57,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:57,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:27:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:27:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:27:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:27:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:27:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:27:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:27:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:27:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:27:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:27:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:27:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:27:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:27:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:27:58,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:27:58,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163395421] [2024-11-20 07:27:58,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163395421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:27:58,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:27:58,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 07:27:58,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94873656] [2024-11-20 07:27:58,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:27:58,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 07:27:58,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:27:58,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 07:27:58,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 07:27:58,480 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:27:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:27:58,711 INFO L93 Difference]: Finished difference Result 112 states and 154 transitions. [2024-11-20 07:27:58,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 07:27:58,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-11-20 07:27:58,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:27:58,716 INFO L225 Difference]: With dead ends: 112 [2024-11-20 07:27:58,716 INFO L226 Difference]: Without dead ends: 68 [2024-11-20 07:27:58,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:27:58,719 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 22 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:27:58,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 144 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:27:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-20 07:27:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2024-11-20 07:27:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 07:27:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2024-11-20 07:27:58,731 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 81 [2024-11-20 07:27:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:27:58,733 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2024-11-20 07:27:58,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:27:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2024-11-20 07:27:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 07:27:58,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:58,735 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:58,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:27:58,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:58,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1098683099, now seen corresponding path program 1 times [2024-11-20 07:27:58,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:27:58,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441206082] [2024-11-20 07:27:58,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:58,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:27:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:27:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:27:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:27:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:27:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:27:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:27:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:27:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:27:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:27:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:27:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:27:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:27:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:27:58,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:27:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441206082] [2024-11-20 07:27:58,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441206082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:27:58,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:27:58,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:27:58,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011679863] [2024-11-20 07:27:58,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:27:58,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:27:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:27:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:27:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:27:58,929 INFO L87 Difference]: Start difference. First operand 55 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:27:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:27:58,982 INFO L93 Difference]: Finished difference Result 151 states and 211 transitions. [2024-11-20 07:27:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:27:58,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-11-20 07:27:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:27:58,987 INFO L225 Difference]: With dead ends: 151 [2024-11-20 07:27:58,987 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 07:27:58,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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 07:27:58,989 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 35 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:27:58,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 128 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:27:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 07:27:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-20 07:27:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 70 states have internal predecessors, (85), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 07:27:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2024-11-20 07:27:59,010 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 81 [2024-11-20 07:27:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:27:59,011 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2024-11-20 07:27:59,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:27:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2024-11-20 07:27:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-20 07:27:59,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:59,013 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:59,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 07:27:59,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:59,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2105512264, now seen corresponding path program 1 times [2024-11-20 07:27:59,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:27:59,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208284192] [2024-11-20 07:27:59,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:59,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:27:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:27:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:27:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:27:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:27:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:27:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:27:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:27:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:27:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:27:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:27:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:27:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:27:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:27:59,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:27:59,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208284192] [2024-11-20 07:27:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208284192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:27:59,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:27:59,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 07:27:59,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001623269] [2024-11-20 07:27:59,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:27:59,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 07:27:59,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:27:59,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 07:27:59,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 07:27:59,211 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:27:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:27:59,302 INFO L93 Difference]: Finished difference Result 167 states and 223 transitions. [2024-11-20 07:27:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 07:27:59,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-20 07:27:59,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:27:59,307 INFO L225 Difference]: With dead ends: 167 [2024-11-20 07:27:59,307 INFO L226 Difference]: Without dead ends: 165 [2024-11-20 07:27:59,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:27:59,309 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 40 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:27:59,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 400 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:27:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-20 07:27:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2024-11-20 07:27:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 118 states have internal predecessors, (137), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 07:27:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 217 transitions. [2024-11-20 07:27:59,339 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 217 transitions. Word has length 83 [2024-11-20 07:27:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:27:59,340 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 217 transitions. [2024-11-20 07:27:59,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:27:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 217 transitions. [2024-11-20 07:27:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-20 07:27:59,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:59,345 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:59,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 07:27:59,345 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:59,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1425453894, now seen corresponding path program 1 times [2024-11-20 07:27:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:27:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833608262] [2024-11-20 07:27:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:27:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:28:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:28:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:28:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:28:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:28:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:28:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:28:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:28:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:28:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:28:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:28:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:28:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:28:00,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:28:00,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833608262] [2024-11-20 07:28:00,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833608262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:28:00,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:28:00,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 07:28:00,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036223097] [2024-11-20 07:28:00,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:28:00,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 07:28:00,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:28:00,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 07:28:00,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:28:00,205 INFO L87 Difference]: Start difference. First operand 161 states and 217 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:28:01,017 INFO L93 Difference]: Finished difference Result 246 states and 324 transitions. [2024-11-20 07:28:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 07:28:01,019 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-20 07:28:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:28:01,023 INFO L225 Difference]: With dead ends: 246 [2024-11-20 07:28:01,024 INFO L226 Difference]: Without dead ends: 244 [2024-11-20 07:28:01,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-11-20 07:28:01,025 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 89 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:28:01,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 562 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 07:28:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-20 07:28:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 215. [2024-11-20 07:28:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 156 states have (on average 1.1794871794871795) internal successors, (184), 160 states have internal predecessors, (184), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 07:28:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 288 transitions. [2024-11-20 07:28:01,065 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 288 transitions. Word has length 83 [2024-11-20 07:28:01,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:28:01,067 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 288 transitions. [2024-11-20 07:28:01,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 288 transitions. [2024-11-20 07:28:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 07:28:01,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:28:01,070 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:01,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 07:28:01,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:28:01,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:28:01,071 INFO L85 PathProgramCache]: Analyzing trace with hash 245561584, now seen corresponding path program 1 times [2024-11-20 07:28:01,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:28:01,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525204306] [2024-11-20 07:28:01,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:28:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:28:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:28:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:28:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:28:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:28:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:28:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:28:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:28:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:28:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:28:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:28:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:28:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:28:01,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:28:01,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525204306] [2024-11-20 07:28:01,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525204306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:28:01,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:28:01,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:28:01,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291640529] [2024-11-20 07:28:01,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:28:01,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:28:01,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:28:01,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:28:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:28:01,139 INFO L87 Difference]: Start difference. First operand 215 states and 288 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:28:01,194 INFO L93 Difference]: Finished difference Result 461 states and 621 transitions. [2024-11-20 07:28:01,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:28:01,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-11-20 07:28:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:28:01,197 INFO L225 Difference]: With dead ends: 461 [2024-11-20 07:28:01,198 INFO L226 Difference]: Without dead ends: 322 [2024-11-20 07:28:01,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 07:28:01,202 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 47 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:28:01,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 154 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:28:01,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-20 07:28:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2024-11-20 07:28:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 225 states have (on average 1.1511111111111112) internal successors, (259), 232 states have internal predecessors, (259), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 07:28:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 427 transitions. [2024-11-20 07:28:01,271 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 427 transitions. Word has length 84 [2024-11-20 07:28:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:28:01,271 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 427 transitions. [2024-11-20 07:28:01,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 427 transitions. [2024-11-20 07:28:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 07:28:01,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:28:01,273 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:01,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 07:28:01,273 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:28:01,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:28:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1798596289, now seen corresponding path program 1 times [2024-11-20 07:28:01,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:28:01,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180475481] [2024-11-20 07:28:01,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:28:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:28:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:28:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:28:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:28:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:28:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:28:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:28:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:28:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:28:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:28:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:28:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:28:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:28:01,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:28:01,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180475481] [2024-11-20 07:28:01,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180475481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:28:01,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:28:01,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:28:01,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39029984] [2024-11-20 07:28:01,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:28:01,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:28:01,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:28:01,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:28:01,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:28:01,325 INFO L87 Difference]: Start difference. First operand 320 states and 427 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:28:01,375 INFO L93 Difference]: Finished difference Result 562 states and 750 transitions. [2024-11-20 07:28:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:28:01,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-11-20 07:28:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:28:01,378 INFO L225 Difference]: With dead ends: 562 [2024-11-20 07:28:01,378 INFO L226 Difference]: Without dead ends: 318 [2024-11-20 07:28:01,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 07:28:01,380 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 56 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:28:01,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 115 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:28:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-20 07:28:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2024-11-20 07:28:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 221 states have (on average 1.1266968325791855) internal successors, (249), 228 states have internal predecessors, (249), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 07:28:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 417 transitions. [2024-11-20 07:28:01,419 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 417 transitions. Word has length 84 [2024-11-20 07:28:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:28:01,419 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 417 transitions. [2024-11-20 07:28:01,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 417 transitions. [2024-11-20 07:28:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 07:28:01,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:28:01,421 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:01,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 07:28:01,421 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:28:01,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:28:01,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1735942787, now seen corresponding path program 1 times [2024-11-20 07:28:01,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:28:01,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797878814] [2024-11-20 07:28:01,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:01,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:28:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:28:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:28:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:28:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:28:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:28:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:28:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:28:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:28:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:28:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:28:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:28:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:28:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:28:01,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:28:01,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797878814] [2024-11-20 07:28:01,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797878814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:28:01,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:28:01,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 07:28:01,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733622446] [2024-11-20 07:28:01,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:28:01,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 07:28:01,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:28:01,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 07:28:01,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 07:28:01,582 INFO L87 Difference]: Start difference. First operand 316 states and 417 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:28:01,660 INFO L93 Difference]: Finished difference Result 622 states and 820 transitions. [2024-11-20 07:28:01,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 07:28:01,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-11-20 07:28:01,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:28:01,665 INFO L225 Difference]: With dead ends: 622 [2024-11-20 07:28:01,665 INFO L226 Difference]: Without dead ends: 309 [2024-11-20 07:28:01,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:28:01,667 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 21 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:28:01,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 216 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:28:01,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-20 07:28:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-20 07:28:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 212 states have (on average 1.0896226415094339) internal successors, (231), 219 states have internal predecessors, (231), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 07:28:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 399 transitions. [2024-11-20 07:28:01,717 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 399 transitions. Word has length 84 [2024-11-20 07:28:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:28:01,717 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 399 transitions. [2024-11-20 07:28:01,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 399 transitions. [2024-11-20 07:28:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-20 07:28:01,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:28:01,719 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:01,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 07:28:01,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:28:01,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:28:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1406869449, now seen corresponding path program 1 times [2024-11-20 07:28:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:28:01,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037380430] [2024-11-20 07:28:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:28:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:28:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:28:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:28:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:28:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:28:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:28:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:28:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:28:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:28:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:28:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:28:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:28:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:02,467 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:28:02,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:28:02,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037380430] [2024-11-20 07:28:02,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037380430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:28:02,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:28:02,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 07:28:02,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005041826] [2024-11-20 07:28:02,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:28:02,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 07:28:02,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:28:02,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 07:28:02,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:28:02,470 INFO L87 Difference]: Start difference. First operand 307 states and 399 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:28:03,155 INFO L93 Difference]: Finished difference Result 606 states and 788 transitions. [2024-11-20 07:28:03,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 07:28:03,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-11-20 07:28:03,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:28:03,158 INFO L225 Difference]: With dead ends: 606 [2024-11-20 07:28:03,159 INFO L226 Difference]: Without dead ends: 372 [2024-11-20 07:28:03,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-20 07:28:03,160 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:28:03,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 579 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 07:28:03,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-20 07:28:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 316. [2024-11-20 07:28:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 221 states have (on average 1.090497737556561) internal successors, (241), 228 states have internal predecessors, (241), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 07:28:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 409 transitions. [2024-11-20 07:28:03,222 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 409 transitions. Word has length 85 [2024-11-20 07:28:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:28:03,223 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 409 transitions. [2024-11-20 07:28:03,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 409 transitions. [2024-11-20 07:28:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-20 07:28:03,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:28:03,224 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:03,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 07:28:03,224 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:28:03,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:28:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1527740812, now seen corresponding path program 1 times [2024-11-20 07:28:03,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:28:03,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879317692] [2024-11-20 07:28:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:03,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:28:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:28:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:28:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:28:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:28:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:28:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:28:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:28:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:28:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:28:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:28:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:28:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:28:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:28:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:28:03,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879317692] [2024-11-20 07:28:03,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879317692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:28:03,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:28:03,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:28:03,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741304018] [2024-11-20 07:28:03,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:28:03,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:28:03,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:28:03,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:28:03,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:28:03,285 INFO L87 Difference]: Start difference. First operand 316 states and 409 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:28:03,357 INFO L93 Difference]: Finished difference Result 663 states and 862 transitions. [2024-11-20 07:28:03,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:28:03,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-11-20 07:28:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:28:03,363 INFO L225 Difference]: With dead ends: 663 [2024-11-20 07:28:03,363 INFO L226 Difference]: Without dead ends: 420 [2024-11-20 07:28:03,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 07:28:03,364 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:28:03,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:28:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-20 07:28:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 348. [2024-11-20 07:28:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 239 states have (on average 1.0794979079497908) internal successors, (258), 248 states have internal predecessors, (258), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 87 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 07:28:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 450 transitions. [2024-11-20 07:28:03,424 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 450 transitions. Word has length 87 [2024-11-20 07:28:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:28:03,425 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 450 transitions. [2024-11-20 07:28:03,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 450 transitions. [2024-11-20 07:28:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 07:28:03,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:28:03,426 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:03,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 07:28:03,426 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:28:03,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:28:03,427 INFO L85 PathProgramCache]: Analyzing trace with hash -74252023, now seen corresponding path program 1 times [2024-11-20 07:28:03,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:28:03,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33444592] [2024-11-20 07:28:03,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:03,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:28:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:28:03,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 07:28:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:28:03,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 07:28:03,511 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 07:28:03,512 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:28:03,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 07:28:03,517 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:28:03,589 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:28:03,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:28:03 BoogieIcfgContainer [2024-11-20 07:28:03,592 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:28:03,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:28:03,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:28:03,593 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:28:03,594 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:27:57" (3/4) ... [2024-11-20 07:28:03,596 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 07:28:03,597 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:28:03,597 INFO L158 Benchmark]: Toolchain (without parser) took 7266.63ms. Allocated memory was 157.3MB in the beginning and 251.7MB in the end (delta: 94.4MB). Free memory was 107.9MB in the beginning and 110.5MB in the end (delta: -2.6MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2024-11-20 07:28:03,598 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:28:03,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.50ms. Allocated memory is still 157.3MB. Free memory was 107.9MB in the beginning and 94.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 07:28:03,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.50ms. Allocated memory is still 157.3MB. Free memory was 94.7MB in the beginning and 92.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:28:03,598 INFO L158 Benchmark]: Boogie Preprocessor took 60.33ms. Allocated memory is still 157.3MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:28:03,599 INFO L158 Benchmark]: RCFGBuilder took 363.49ms. Allocated memory is still 157.3MB. Free memory was 90.7MB in the beginning and 75.8MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 07:28:03,599 INFO L158 Benchmark]: TraceAbstraction took 6421.52ms. Allocated memory was 157.3MB in the beginning and 251.7MB in the end (delta: 94.4MB). Free memory was 74.9MB in the beginning and 110.5MB in the end (delta: -35.5MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-11-20 07:28:03,599 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 251.7MB. Free memory is still 110.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:28:03,600 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.50ms. Allocated memory is still 157.3MB. Free memory was 107.9MB in the beginning and 94.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.50ms. Allocated memory is still 157.3MB. Free memory was 94.7MB in the beginning and 92.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.33ms. Allocated memory is still 157.3MB. Free memory was 92.8MB in the beginning and 90.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 363.49ms. Allocated memory is still 157.3MB. Free memory was 90.7MB in the beginning and 75.8MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6421.52ms. Allocated memory was 157.3MB in the beginning and 251.7MB in the end (delta: 94.4MB). Free memory was 74.9MB in the beginning and 110.5MB in the end (delta: -35.5MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 251.7MB. Free memory is still 110.5MB. 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 bitwiseOr at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 0; [L26] signed char var_1_5 = 4; [L27] signed char var_1_6 = -5; [L28] signed char var_1_7 = 2; [L29] signed char var_1_8 = -32; VAL [isInitial=0, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L68] isInitial = 1 [L69] FCALL initially() [L70] COND TRUE 1 [L71] FCALL updateLastVariables() [L72] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_uchar() [L43] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L43] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L45] var_1_3 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L51] var_1_5 = __VERIFIER_nondet_char() [L52] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=-5, var_1_7=2, var_1_8=-32] [L52] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=-5, var_1_7=2, var_1_8=-32] [L54] var_1_6 = __VERIFIER_nondet_char() [L55] CALL assume_abort_if_not(var_1_6 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=2, var_1_8=-32] [L55] RET assume_abort_if_not(var_1_6 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=2, var_1_8=-32] [L56] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=2, var_1_8=-32] [L56] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=2, var_1_8=-32] [L57] var_1_7 = __VERIFIER_nondet_char() [L58] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L58] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L59] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L59] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L72] RET updateVariables() [L73] CALL step() [L33] COND TRUE (var_1_2 || var_1_3) && var_1_4 [L34] var_1_1 = (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L36] signed char stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=-24, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L37] EXPR (-100 + var_1_1) ^ var_1_1 VAL [isInitial=1, stepLocal_0=-24, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L37] COND FALSE !(stepLocal_0 > ((-100 + var_1_1) ^ var_1_1)) [L73] RET step() [L74] CALL, EXPR property() [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [isInitial=1, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L64] EXPR (-100 + var_1_1) ^ var_1_1 VAL [isInitial=1, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [isInitial=1, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L64-L65] return (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) ; [L74] RET, EXPR property() [L74] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] [L19] reach_error() VAL [isInitial=1, var_1_1=38, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-24, var_1_6=63, var_1_7=38, var_1_8=-32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 473 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 467 mSDsluCounter, 2471 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1679 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 928 IncrementalHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 792 mSDtfsCounter, 928 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=10, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 182 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 922 NumberOfCodeBlocks, 922 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 823 ConstructedInterpolants, 0 QuantifiedInterpolants, 2328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 2640/2640 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 07:28:03,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.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 e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:28:05,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:28:05,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 07:28:05,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:28:05,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:28:05,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:28:05,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:28:05,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:28:05,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:28:05,984 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:28:05,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:28:05,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:28:05,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:28:05,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:28:05,989 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:28:05,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:28:05,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:28:05,990 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:28:05,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:28:05,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:28:05,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:28:05,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:28:05,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:28:05,994 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 07:28:05,994 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 07:28:05,994 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:28:05,994 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 07:28:05,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:28:05,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:28:05,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:28:05,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:28:05,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:28:05,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:28:05,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:28:05,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:28:05,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:28:05,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:28:06,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:28:06,010 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 07:28:06,011 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 07:28:06,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:28:06,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:28:06,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:28:06,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:28:06,012 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 -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2024-11-20 07:28:06,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:28:06,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:28:06,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:28:06,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:28:06,365 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:28:06,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-11-20 07:28:07,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:28:08,085 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:28:08,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2024-11-20 07:28:08,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4978f860b/fe4bba455f634a058041ffdfca2232cc/FLAGb65e93a1f [2024-11-20 07:28:08,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4978f860b/fe4bba455f634a058041ffdfca2232cc [2024-11-20 07:28:08,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:28:08,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:28:08,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:28:08,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:28:08,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:28:08,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce00fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08, skipping insertion in model container [2024-11-20 07:28:08,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:28:08,675 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_operatoramount_amount10_file-60.i[915,928] [2024-11-20 07:28:08,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:28:08,737 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:28:08,749 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_operatoramount_amount10_file-60.i[915,928] [2024-11-20 07:28:08,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:28:08,792 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:28:08,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08 WrapperNode [2024-11-20 07:28:08,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:28:08,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:28:08,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:28:08,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:28:08,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,838 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2024-11-20 07:28:08,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:28:08,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:28:08,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:28:08,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:28:08,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,879 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 07:28:08,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:28:08,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:28:08,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:28:08,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:28:08,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (1/1) ... [2024-11-20 07:28:08,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:28:08,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:28:08,950 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 07:28:08,957 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 07:28:09,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:28:09,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 07:28:09,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:28:09,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:28:09,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:28:09,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:28:09,083 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:28:09,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:28:09,299 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 07:28:09,300 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:28:09,316 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:28:09,316 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:28:09,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:28:09 BoogieIcfgContainer [2024-11-20 07:28:09,317 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:28:09,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:28:09,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:28:09,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:28:09,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:28:08" (1/3) ... [2024-11-20 07:28:09,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420c96f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:28:09, skipping insertion in model container [2024-11-20 07:28:09,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:28:08" (2/3) ... [2024-11-20 07:28:09,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420c96f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:28:09, skipping insertion in model container [2024-11-20 07:28:09,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:28:09" (3/3) ... [2024-11-20 07:28:09,326 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2024-11-20 07:28:09,358 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:28:09,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:28:09,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:28:09,434 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;@3af7f019, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:28:09,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:28:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 07:28:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 07:28:09,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:28:09,451 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:09,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:28:09,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:28:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash 971633535, now seen corresponding path program 1 times [2024-11-20 07:28:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:28:09,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026143871] [2024-11-20 07:28:09,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:09,475 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 07:28:09,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:28:09,478 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 07:28:09,480 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 07:28:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:09,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 07:28:09,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:28:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-20 07:28:09,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:28:09,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:28:09,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026143871] [2024-11-20 07:28:09,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026143871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:28:09,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:28:09,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:28:09,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428827539] [2024-11-20 07:28:09,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:28:09,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:28:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:28:09,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:28:09,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:28:09,694 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 07:28:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:28:09,720 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2024-11-20 07:28:09,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:28:09,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-11-20 07:28:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:28:09,729 INFO L225 Difference]: With dead ends: 73 [2024-11-20 07:28:09,729 INFO L226 Difference]: Without dead ends: 36 [2024-11-20 07:28:09,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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 07:28:09,735 INFO L432 NwaCegarLoop]: 49 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, 49 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 07:28:09,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:28:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-20 07:28:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-20 07:28:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 07:28:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-20 07:28:09,778 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 78 [2024-11-20 07:28:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:28:09,779 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-20 07:28:09,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 07:28:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-20 07:28:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 07:28:09,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:28:09,783 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:09,789 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 07:28:09,984 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 07:28:09,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:28:09,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:28:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash -483648641, now seen corresponding path program 1 times [2024-11-20 07:28:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:28:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098691991] [2024-11-20 07:28:09,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:09,987 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 07:28:09,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:28:09,990 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 07:28:09,999 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 07:28:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:10,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 07:28:10,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:28:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:28:12,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:28:12,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:28:12,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098691991] [2024-11-20 07:28:12,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098691991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:28:12,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:28:12,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 07:28:12,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827563134] [2024-11-20 07:28:12,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:28:12,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 07:28:12,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:28:12,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 07:28:12,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 07:28:12,760 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:28:12,976 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2024-11-20 07:28:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 07:28:12,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2024-11-20 07:28:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:28:12,979 INFO L225 Difference]: With dead ends: 80 [2024-11-20 07:28:12,980 INFO L226 Difference]: Without dead ends: 78 [2024-11-20 07:28:12,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:28:12,981 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:28:12,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 262 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:28:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-20 07:28:13,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2024-11-20 07:28:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 07:28:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2024-11-20 07:28:13,007 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 78 [2024-11-20 07:28:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:28:13,008 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2024-11-20 07:28:13,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-11-20 07:28:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 07:28:13,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:28:13,013 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:13,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 07:28:13,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:28:13,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:28:13,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:28:13,217 INFO L85 PathProgramCache]: Analyzing trace with hash -481801599, now seen corresponding path program 1 times [2024-11-20 07:28:13,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:28:13,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453225882] [2024-11-20 07:28:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:13,218 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 07:28:13,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:28:13,221 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:28:13,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 07:28:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:13,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 07:28:13,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:28:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 150 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-20 07:28:15,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:28:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:28:17,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:28:17,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453225882] [2024-11-20 07:28:17,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453225882] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 07:28:17,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 07:28:17,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2024-11-20 07:28:17,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605988788] [2024-11-20 07:28:17,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:28:17,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:28:17,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:28:17,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:28:17,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-20 07:28:17,209 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:28:17,986 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2024-11-20 07:28:17,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:28:17,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2024-11-20 07:28:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:28:17,990 INFO L225 Difference]: With dead ends: 92 [2024-11-20 07:28:17,990 INFO L226 Difference]: Without dead ends: 90 [2024-11-20 07:28:17,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-11-20 07:28:17,992 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 50 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 07:28:17,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 267 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 07:28:17,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-20 07:28:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2024-11-20 07:28:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 07:28:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2024-11-20 07:28:18,006 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 78 [2024-11-20 07:28:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:28:18,007 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2024-11-20 07:28:18,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2024-11-20 07:28:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 07:28:18,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:28:18,008 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:18,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 07:28:18,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 07:28:18,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:28:18,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:28:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1291358721, now seen corresponding path program 1 times [2024-11-20 07:28:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:28:18,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585509625] [2024-11-20 07:28:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:18,213 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 07:28:18,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:28:18,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:28:18,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 07:28:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:18,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 07:28:18,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:28:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 07:28:19,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:28:19,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:28:19,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585509625] [2024-11-20 07:28:19,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585509625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:28:19,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:28:19,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 07:28:19,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998780085] [2024-11-20 07:28:19,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:28:19,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 07:28:19,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:28:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 07:28:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 07:28:19,188 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:19,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:28:19,268 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-11-20 07:28:19,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 07:28:19,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2024-11-20 07:28:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:28:19,269 INFO L225 Difference]: With dead ends: 66 [2024-11-20 07:28:19,270 INFO L226 Difference]: Without dead ends: 64 [2024-11-20 07:28:19,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:28:19,271 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 19 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:28:19,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 200 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:28:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-20 07:28:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-11-20 07:28:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 07:28:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2024-11-20 07:28:19,283 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 78 [2024-11-20 07:28:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:28:19,283 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2024-11-20 07:28:19,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2024-11-20 07:28:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 07:28:19,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:28:19,285 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:19,290 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 (5)] Ended with exit code 0 [2024-11-20 07:28:19,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 07:28:19,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:28:19,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:28:19,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1293205763, now seen corresponding path program 1 times [2024-11-20 07:28:19,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:28:19,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501510685] [2024-11-20 07:28:19,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:19,487 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 07:28:19,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:28:19,490 INFO L229 MonitoredProcess]: Starting monitored process 6 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 07:28:19,491 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 (6)] Waiting until timeout for monitored process [2024-11-20 07:28:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:19,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 07:28:19,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:28:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-20 07:28:19,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:28:19,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:28:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501510685] [2024-11-20 07:28:19,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501510685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:28:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [756066584] [2024-11-20 07:28:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:19,840 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 07:28:19,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 07:28:19,843 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 07:28:19,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-20 07:28:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:19,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 07:28:19,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:28:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 143 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-20 07:28:20,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:28:20,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [756066584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:28:20,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 07:28:20,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-20 07:28:20,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568678592] [2024-11-20 07:28:20,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 07:28:20,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:28:20,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:28:20,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:28:20,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-20 07:28:20,136 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 07:28:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:28:20,306 INFO L93 Difference]: Finished difference Result 168 states and 223 transitions. [2024-11-20 07:28:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 07:28:20,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-11-20 07:28:20,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:28:20,311 INFO L225 Difference]: With dead ends: 168 [2024-11-20 07:28:20,311 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 07:28:20,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-20 07:28:20,314 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 24 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:28:20,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 124 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:28:20,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 07:28:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2024-11-20 07:28:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 68 states have internal predecessors, (71), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 07:28:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 143 transitions. [2024-11-20 07:28:20,345 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 143 transitions. Word has length 78 [2024-11-20 07:28:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:28:20,347 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 143 transitions. [2024-11-20 07:28:20,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 07:28:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 143 transitions. [2024-11-20 07:28:20,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 07:28:20,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:28:20,351 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:28:20,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-20 07:28:20,554 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 (6)] Ended with exit code 0 [2024-11-20 07:28:20,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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 07:28:20,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:28:20,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:28:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash 287456292, now seen corresponding path program 1 times [2024-11-20 07:28:20,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:28:20,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22686194] [2024-11-20 07:28:20,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:28:20,753 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 07:28:20,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:28:20,756 INFO L229 MonitoredProcess]: Starting monitored process 8 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 07:28:20,757 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 (8)] Waiting until timeout for monitored process [2024-11-20 07:28:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:28:20,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-20 07:28:20,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:28:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 729 proven. 196 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-11-20 07:28:23,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:28:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1130 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2024-11-20 07:28:26,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:28:26,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22686194] [2024-11-20 07:28:26,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22686194] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 07:28:26,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 07:28:26,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2024-11-20 07:28:26,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152535254] [2024-11-20 07:28:26,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:28:26,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:28:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:28:26,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:28:26,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-20 07:28:26,359 INFO L87 Difference]: Start difference. First operand 108 states and 143 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:28:28,502 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2024-11-20 07:28:28,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:28:28,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 153 [2024-11-20 07:28:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:28:28,504 INFO L225 Difference]: With dead ends: 111 [2024-11-20 07:28:28,504 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 07:28:28,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2024-11-20 07:28:28,507 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 14 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 07:28:28,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 236 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 07:28:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 07:28:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 07:28:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 07:28:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 07:28:28,510 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2024-11-20 07:28:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:28:28,510 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 07:28:28,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 07:28:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 07:28:28,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 07:28:28,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:28:28,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-20 07:28:28,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 07:28:28,720 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 07:28:28,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 07:28:30,366 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:28:30,375 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-20 07:28:30,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-20 07:28:30,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:28:30 BoogieIcfgContainer [2024-11-20 07:28:30,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:28:30,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:28:30,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:28:30,396 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:28:30,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:28:09" (3/4) ... [2024-11-20 07:28:30,399 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 07:28:30,403 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 07:28:30,408 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-20 07:28:30,409 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-20 07:28:30,410 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 07:28:30,410 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 07:28:30,507 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 07:28:30,508 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 07:28:30,508 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:28:30,509 INFO L158 Benchmark]: Toolchain (without parser) took 22059.03ms. Allocated memory was 75.5MB in the beginning and 346.0MB in the end (delta: 270.5MB). Free memory was 44.1MB in the beginning and 124.2MB in the end (delta: -80.1MB). Peak memory consumption was 189.2MB. Max. memory is 16.1GB. [2024-11-20 07:28:30,509 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 54.5MB. Free memory is still 29.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:28:30,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.31ms. Allocated memory is still 75.5MB. Free memory was 43.9MB in the beginning and 50.3MB in the end (delta: -6.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-20 07:28:30,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.74ms. Allocated memory is still 75.5MB. Free memory was 50.3MB in the beginning and 48.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:28:30,510 INFO L158 Benchmark]: Boogie Preprocessor took 67.55ms. Allocated memory is still 75.5MB. Free memory was 48.7MB in the beginning and 46.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:28:30,511 INFO L158 Benchmark]: RCFGBuilder took 408.18ms. Allocated memory is still 75.5MB. Free memory was 46.4MB in the beginning and 33.0MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 07:28:30,511 INFO L158 Benchmark]: TraceAbstraction took 21076.56ms. Allocated memory was 75.5MB in the beginning and 346.0MB in the end (delta: 270.5MB). Free memory was 32.4MB in the beginning and 129.4MB in the end (delta: -97.1MB). Peak memory consumption was 187.1MB. Max. memory is 16.1GB. [2024-11-20 07:28:30,511 INFO L158 Benchmark]: Witness Printer took 112.57ms. Allocated memory is still 346.0MB. Free memory was 129.4MB in the beginning and 124.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 07:28:30,513 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.96ms. Allocated memory is still 54.5MB. Free memory is still 29.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.31ms. Allocated memory is still 75.5MB. Free memory was 43.9MB in the beginning and 50.3MB in the end (delta: -6.4MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.74ms. Allocated memory is still 75.5MB. Free memory was 50.3MB in the beginning and 48.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.55ms. Allocated memory is still 75.5MB. Free memory was 48.7MB in the beginning and 46.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 408.18ms. Allocated memory is still 75.5MB. Free memory was 46.4MB in the beginning and 33.0MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21076.56ms. Allocated memory was 75.5MB in the beginning and 346.0MB in the end (delta: 270.5MB). Free memory was 32.4MB in the beginning and 129.4MB in the end (delta: -97.1MB). Peak memory consumption was 187.1MB. Max. memory is 16.1GB. * Witness Printer took 112.57ms. Allocated memory is still 346.0MB. Free memory was 129.4MB in the beginning and 124.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 1138 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 815 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 393 IncrementalHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 323 mSDtfsCounter, 393 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 929 GetRequests, 861 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=5, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 621 NumberOfCodeBlocks, 621 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 843 ConstructedInterpolants, 82 QuantifiedInterpolants, 5470 SizeOfPredicates, 49 NumberOfNonLiveVariables, 988 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 3858/4108 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((var_1_1 != 1) || (0 != cond)) && (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8)))) RESULT: Ultimate proved your program to be correct! [2024-11-20 07:28:30,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE