./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.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 062a802759b4aa2a0cbcb5cdde30f3437c09c950e76bee485cf882952e2d339f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:51:27,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:51:27,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:51:27,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:51:27,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:51:27,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:51:27,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:51:27,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:51:27,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:51:27,257 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:51:27,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:51:27,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:51:27,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:51:27,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:51:27,258 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:51:27,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:51:27,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:51:27,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:51:27,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:51:27,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:51:27,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:51:27,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:51:27,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:51:27,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:51:27,262 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:51:27,262 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:51:27,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:51:27,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:51:27,262 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:51:27,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:51:27,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:51:27,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:51:27,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:51:27,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:51:27,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:51:27,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:51:27,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:51:27,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:51:27,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:51:27,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:51:27,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:51:27,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:51:27,265 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 -> 062a802759b4aa2a0cbcb5cdde30f3437c09c950e76bee485cf882952e2d339f [2024-11-16 14:51:27,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:51:27,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:51:27,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:51:27,472 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:51:27,472 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:51:27,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2024-11-16 14:51:28,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:51:28,829 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:51:28,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2024-11-16 14:51:28,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a3b9ad8f/aa04927cc04a4025bf29aebeca20f5f2/FLAG2961c87db [2024-11-16 14:51:29,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a3b9ad8f/aa04927cc04a4025bf29aebeca20f5f2 [2024-11-16 14:51:29,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:51:29,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:51:29,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:51:29,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:51:29,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:51:29,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5794b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29, skipping insertion in model container [2024-11-16 14:51:29,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:51:29,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i[919,932] [2024-11-16 14:51:29,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:51:29,532 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:51:29,541 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i[919,932] [2024-11-16 14:51:29,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:51:29,588 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:51:29,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29 WrapperNode [2024-11-16 14:51:29,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:51:29,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:51:29,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:51:29,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:51:29,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,645 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-16 14:51:29,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:51:29,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:51:29,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:51:29,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:51:29,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,680 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-16 14:51:29,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,692 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:51:29,709 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:51:29,710 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:51:29,710 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:51:29,711 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (1/1) ... [2024-11-16 14:51:29,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:51:29,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:51:29,743 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-16 14:51:29,746 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-16 14:51:29,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:51:29,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:51:29,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:51:29,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:51:29,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:51:29,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:51:29,858 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:51:29,860 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:51:30,145 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L165: havoc property_#t~bitwise18#1; [2024-11-16 14:51:30,174 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 14:51:30,174 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:51:30,199 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:51:30,199 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:51:30,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:51:30 BoogieIcfgContainer [2024-11-16 14:51:30,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:51:30,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:51:30,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:51:30,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:51:30,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:51:29" (1/3) ... [2024-11-16 14:51:30,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ed7188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:51:30, skipping insertion in model container [2024-11-16 14:51:30,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:29" (2/3) ... [2024-11-16 14:51:30,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ed7188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:51:30, skipping insertion in model container [2024-11-16 14:51:30,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:51:30" (3/3) ... [2024-11-16 14:51:30,205 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2024-11-16 14:51:30,224 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:51:30,224 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:51:30,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:51:30,274 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;@7da5ae49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:51:30,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:51:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 14:51:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 14:51:30,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:30,292 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:30,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:30,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:30,300 INFO L85 PathProgramCache]: Analyzing trace with hash -787625431, now seen corresponding path program 1 times [2024-11-16 14:51:30,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:30,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460231707] [2024-11-16 14:51:30,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:51:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:51:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:51:30,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:30,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460231707] [2024-11-16 14:51:30,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460231707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:30,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:30,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:51:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745429098] [2024-11-16 14:51:30,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:30,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:51:30,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:30,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:51:30,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:51:30,706 INFO L87 Difference]: Start difference. First operand has 86 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 14:51:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:30,742 INFO L93 Difference]: Finished difference Result 164 states and 277 transitions. [2024-11-16 14:51:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:51:30,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2024-11-16 14:51:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:30,749 INFO L225 Difference]: With dead ends: 164 [2024-11-16 14:51:30,750 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 14:51:30,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-16 14:51:30,758 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:30,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:51:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 14:51:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-16 14:51:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 14:51:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2024-11-16 14:51:30,801 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 122 transitions. Word has length 142 [2024-11-16 14:51:30,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:30,802 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 122 transitions. [2024-11-16 14:51:30,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 14:51:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 122 transitions. [2024-11-16 14:51:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 14:51:30,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:30,805 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:30,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:51:30,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:30,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash 579511333, now seen corresponding path program 1 times [2024-11-16 14:51:30,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:30,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073525465] [2024-11-16 14:51:30,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:30,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:51:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:51:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:51:31,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:31,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073525465] [2024-11-16 14:51:31,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073525465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:31,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:31,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:51:31,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321485936] [2024-11-16 14:51:31,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:31,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:51:31,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:31,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:51:31,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:51:31,093 INFO L87 Difference]: Start difference. First operand 81 states and 122 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:51:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:31,169 INFO L93 Difference]: Finished difference Result 212 states and 319 transitions. [2024-11-16 14:51:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:51:31,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-11-16 14:51:31,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:31,171 INFO L225 Difference]: With dead ends: 212 [2024-11-16 14:51:31,171 INFO L226 Difference]: Without dead ends: 134 [2024-11-16 14:51:31,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-16 14:51:31,173 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 68 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:31,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 282 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:51:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-16 14:51:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2024-11-16 14:51:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 14:51:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 195 transitions. [2024-11-16 14:51:31,193 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 195 transitions. Word has length 142 [2024-11-16 14:51:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:31,193 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 195 transitions. [2024-11-16 14:51:31,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:51:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 195 transitions. [2024-11-16 14:51:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 14:51:31,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:31,195 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:31,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:51:31,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:31,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash 68977156, now seen corresponding path program 1 times [2024-11-16 14:51:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:31,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240415452] [2024-11-16 14:51:31,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:51:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:51:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:51:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:31,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240415452] [2024-11-16 14:51:31,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240415452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:31,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:31,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 14:51:31,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137957066] [2024-11-16 14:51:31,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:31,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 14:51:31,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:31,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 14:51:31,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 14:51:31,742 INFO L87 Difference]: Start difference. First operand 130 states and 195 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:51:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:32,096 INFO L93 Difference]: Finished difference Result 375 states and 567 transitions. [2024-11-16 14:51:32,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 14:51:32,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-11-16 14:51:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:32,102 INFO L225 Difference]: With dead ends: 375 [2024-11-16 14:51:32,103 INFO L226 Difference]: Without dead ends: 248 [2024-11-16 14:51:32,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 14:51:32,106 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 122 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:32,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 440 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:51:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-16 14:51:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 199. [2024-11-16 14:51:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 149 states have (on average 1.429530201342282) internal successors, (213), 150 states have internal predecessors, (213), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 14:51:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 305 transitions. [2024-11-16 14:51:32,134 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 305 transitions. Word has length 142 [2024-11-16 14:51:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:32,137 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 305 transitions. [2024-11-16 14:51:32,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:51:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 305 transitions. [2024-11-16 14:51:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 14:51:32,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:32,140 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:32,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:51:32,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:32,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash 525923522, now seen corresponding path program 1 times [2024-11-16 14:51:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:32,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405640746] [2024-11-16 14:51:32,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:32,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:51:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:51:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:51:32,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405640746] [2024-11-16 14:51:32,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405640746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:32,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:32,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:51:32,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552841154] [2024-11-16 14:51:32,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:32,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:51:32,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:32,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:51:32,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:51:32,333 INFO L87 Difference]: Start difference. First operand 199 states and 305 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:51:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:32,410 INFO L93 Difference]: Finished difference Result 459 states and 697 transitions. [2024-11-16 14:51:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:51:32,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-16 14:51:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:32,413 INFO L225 Difference]: With dead ends: 459 [2024-11-16 14:51:32,414 INFO L226 Difference]: Without dead ends: 326 [2024-11-16 14:51:32,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:51:32,416 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 78 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:32,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 312 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:51:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-16 14:51:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 323. [2024-11-16 14:51:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 245 states have (on average 1.416326530612245) internal successors, (347), 247 states have internal predecessors, (347), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 14:51:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 491 transitions. [2024-11-16 14:51:32,454 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 491 transitions. Word has length 143 [2024-11-16 14:51:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:32,454 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 491 transitions. [2024-11-16 14:51:32,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:51:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 491 transitions. [2024-11-16 14:51:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 14:51:32,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:32,456 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:32,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 14:51:32,456 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:32,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:32,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1792358697, now seen corresponding path program 1 times [2024-11-16 14:51:32,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:32,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806204662] [2024-11-16 14:51:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:32,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:51:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:51:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:51:32,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:32,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806204662] [2024-11-16 14:51:32,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806204662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:32,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:32,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 14:51:32,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250377505] [2024-11-16 14:51:32,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:32,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 14:51:32,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:32,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 14:51:32,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 14:51:32,671 INFO L87 Difference]: Start difference. First operand 323 states and 491 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:51:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:32,904 INFO L93 Difference]: Finished difference Result 661 states and 989 transitions. [2024-11-16 14:51:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 14:51:32,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-16 14:51:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:32,906 INFO L225 Difference]: With dead ends: 661 [2024-11-16 14:51:32,907 INFO L226 Difference]: Without dead ends: 410 [2024-11-16 14:51:32,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 14:51:32,910 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 175 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:32,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 212 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:51:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-16 14:51:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 335. [2024-11-16 14:51:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 257 states have (on average 1.404669260700389) internal successors, (361), 259 states have internal predecessors, (361), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 14:51:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 505 transitions. [2024-11-16 14:51:32,938 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 505 transitions. Word has length 145 [2024-11-16 14:51:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:32,938 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 505 transitions. [2024-11-16 14:51:32,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:51:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 505 transitions. [2024-11-16 14:51:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 14:51:32,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:32,939 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:32,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 14:51:32,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:32,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:32,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1286800072, now seen corresponding path program 1 times [2024-11-16 14:51:32,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:32,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951283290] [2024-11-16 14:51:32,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:32,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:51:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:51:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:51:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:51:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:51:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:51:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:51:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:51:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:51:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:51:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:51:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:51:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:51:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:51:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:51:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:51:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:51:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:51:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:51:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:51:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 14:51:33,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:33,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951283290] [2024-11-16 14:51:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951283290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:51:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185396901] [2024-11-16 14:51:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:33,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:51:33,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:51:33,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:51:33,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 14:51:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:33,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 14:51:33,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:51:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 417 proven. 78 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-16 14:51:33,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:51:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-16 14:51:34,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185396901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:51:34,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:51:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-16 14:51:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135828163] [2024-11-16 14:51:34,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:51:34,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 14:51:34,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:51:34,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 14:51:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-16 14:51:34,151 INFO L87 Difference]: Start difference. First operand 335 states and 505 transitions. Second operand has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 7 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 7 states have call predecessors, (59), 7 states have call successors, (59) [2024-11-16 14:51:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:34,793 INFO L93 Difference]: Finished difference Result 741 states and 1066 transitions. [2024-11-16 14:51:34,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-16 14:51:34,793 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 7 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 7 states have call predecessors, (59), 7 states have call successors, (59) Word has length 145 [2024-11-16 14:51:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:34,795 INFO L225 Difference]: With dead ends: 741 [2024-11-16 14:51:34,796 INFO L226 Difference]: Without dead ends: 458 [2024-11-16 14:51:34,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=333, Invalid=927, Unknown=0, NotChecked=0, Total=1260 [2024-11-16 14:51:34,797 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 536 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 14:51:34,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 285 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 14:51:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-16 14:51:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 361. [2024-11-16 14:51:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 275 states have (on average 1.3127272727272727) internal successors, (361), 277 states have internal predecessors, (361), 72 states have call successors, (72), 13 states have call predecessors, (72), 13 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 14:51:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 505 transitions. [2024-11-16 14:51:34,848 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 505 transitions. Word has length 145 [2024-11-16 14:51:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:34,849 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 505 transitions. [2024-11-16 14:51:34,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 7 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 7 states have call predecessors, (59), 7 states have call successors, (59) [2024-11-16 14:51:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 505 transitions. [2024-11-16 14:51:34,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 14:51:34,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:34,851 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:34,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 14:51:35,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 14:51:35,056 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:35,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash 417450075, now seen corresponding path program 1 times [2024-11-16 14:51:35,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:51:35,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598497583] [2024-11-16 14:51:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:35,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:51:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 14:51:35,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521930388] [2024-11-16 14:51:35,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:35,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:51:35,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:51:35,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:51:35,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 14:51:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:35,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 14:51:35,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:51:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 438 proven. 57 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-16 14:51:35,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:51:45,345 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-16 14:51:45,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-16 14:51:45,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:51:45,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598497583] [2024-11-16 14:51:45,348 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 14:51:45,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521930388] [2024-11-16 14:51:45,348 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-16 14:51:45,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 14:51:45,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-16 14:51:45,549 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:360) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-16 14:51:45,554 INFO L158 Benchmark]: Toolchain (without parser) took 16320.70ms. Allocated memory was 182.5MB in the beginning and 310.4MB in the end (delta: 127.9MB). Free memory was 113.3MB in the beginning and 165.1MB in the end (delta: -51.8MB). Peak memory consumption was 78.3MB. Max. memory is 16.1GB. [2024-11-16 14:51:45,554 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 107.0MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:51:45,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.43ms. Allocated memory is still 182.5MB. Free memory was 113.1MB in the beginning and 147.3MB in the end (delta: -34.2MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-16 14:51:45,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.53ms. Allocated memory is still 182.5MB. Free memory was 147.3MB in the beginning and 142.4MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 14:51:45,554 INFO L158 Benchmark]: Boogie Preprocessor took 62.75ms. Allocated memory is still 182.5MB. Free memory was 142.4MB in the beginning and 135.4MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 14:51:45,555 INFO L158 Benchmark]: IcfgBuilder took 490.18ms. Allocated memory is still 182.5MB. Free memory was 135.4MB in the beginning and 106.8MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 14:51:45,555 INFO L158 Benchmark]: TraceAbstraction took 15352.47ms. Allocated memory was 182.5MB in the beginning and 310.4MB in the end (delta: 127.9MB). Free memory was 106.0MB in the beginning and 165.1MB in the end (delta: -59.1MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2024-11-16 14:51:45,556 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.34ms. Allocated memory is still 107.0MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.43ms. Allocated memory is still 182.5MB. Free memory was 113.1MB in the beginning and 147.3MB in the end (delta: -34.2MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.53ms. Allocated memory is still 182.5MB. Free memory was 147.3MB in the beginning and 142.4MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.75ms. Allocated memory is still 182.5MB. Free memory was 142.4MB in the beginning and 135.4MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 490.18ms. Allocated memory is still 182.5MB. Free memory was 135.4MB in the beginning and 106.8MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15352.47ms. Allocated memory was 182.5MB in the beginning and 310.4MB in the end (delta: 127.9MB). Free memory was 106.0MB in the beginning and 165.1MB in the end (delta: -59.1MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.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 062a802759b4aa2a0cbcb5cdde30f3437c09c950e76bee485cf882952e2d339f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:51:47,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:51:47,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 14:51:47,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:51:47,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:51:47,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:51:47,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:51:47,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:51:47,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:51:47,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:51:47,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:51:47,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:51:47,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:51:47,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:51:47,226 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:51:47,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:51:47,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:51:47,227 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:51:47,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:51:47,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:51:47,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:51:47,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:51:47,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:51:47,228 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 14:51:47,228 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 14:51:47,229 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:51:47,229 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 14:51:47,229 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:51:47,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:51:47,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:51:47,230 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:51:47,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:51:47,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:51:47,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:51:47,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:51:47,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:51:47,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:51:47,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:51:47,231 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 14:51:47,231 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 14:51:47,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:51:47,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:51:47,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:51:47,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:51:47,232 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 -> 062a802759b4aa2a0cbcb5cdde30f3437c09c950e76bee485cf882952e2d339f [2024-11-16 14:51:47,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:51:47,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:51:47,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:51:47,512 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:51:47,512 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:51:47,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2024-11-16 14:51:48,825 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:51:49,004 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:51:49,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2024-11-16 14:51:49,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fd38b208/a128951702fe4fddbf801bed3a3b367f/FLAG0591b3610 [2024-11-16 14:51:49,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fd38b208/a128951702fe4fddbf801bed3a3b367f [2024-11-16 14:51:49,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:51:49,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:51:49,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:51:49,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:51:49,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:51:49,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c3e0cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49, skipping insertion in model container [2024-11-16 14:51:49,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:51:49,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i[919,932] [2024-11-16 14:51:49,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:51:49,651 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:51:49,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i[919,932] [2024-11-16 14:51:49,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:51:49,710 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:51:49,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49 WrapperNode [2024-11-16 14:51:49,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:51:49,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:51:49,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:51:49,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:51:49,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,763 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-11-16 14:51:49,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:51:49,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:51:49,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:51:49,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:51:49,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,798 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-16 14:51:49,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:51:49,827 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:51:49,828 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:51:49,828 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:51:49,828 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (1/1) ... [2024-11-16 14:51:49,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:51:49,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:51:49,860 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-16 14:51:49,863 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-16 14:51:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:51:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 14:51:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:51:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:51:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:51:49,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:51:49,980 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:51:49,982 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:51:54,187 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 14:51:54,188 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:51:54,200 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:51:54,200 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:51:54,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:51:54 BoogieIcfgContainer [2024-11-16 14:51:54,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:51:54,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:51:54,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:51:54,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:51:54,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:51:49" (1/3) ... [2024-11-16 14:51:54,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd7fc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:51:54, skipping insertion in model container [2024-11-16 14:51:54,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:51:49" (2/3) ... [2024-11-16 14:51:54,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd7fc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:51:54, skipping insertion in model container [2024-11-16 14:51:54,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:51:54" (3/3) ... [2024-11-16 14:51:54,209 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-13.i [2024-11-16 14:51:54,220 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:51:54,221 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:51:54,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:51:54,277 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;@1df5603f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:51:54,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:51:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 14:51:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 14:51:54,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:54,290 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:54,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:54,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:54,295 INFO L85 PathProgramCache]: Analyzing trace with hash 71508601, now seen corresponding path program 1 times [2024-11-16 14:51:54,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:51:54,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256314406] [2024-11-16 14:51:54,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:54,306 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-16 14:51:54,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:51:54,309 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-16 14:51:54,310 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-16 14:51:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:54,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 14:51:54,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:51:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-16 14:51:54,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:51:54,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:51:54,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256314406] [2024-11-16 14:51:54,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256314406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:51:54,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:51:54,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:51:54,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124282033] [2024-11-16 14:51:54,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:54,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:51:54,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:51:54,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:51:54,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:51:54,733 INFO L87 Difference]: Start difference. First operand has 78 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 14:51:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:51:54,754 INFO L93 Difference]: Finished difference Result 148 states and 253 transitions. [2024-11-16 14:51:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:51:54,755 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 139 [2024-11-16 14:51:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:51:54,764 INFO L225 Difference]: With dead ends: 148 [2024-11-16 14:51:54,764 INFO L226 Difference]: Without dead ends: 73 [2024-11-16 14:51:54,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-16 14:51:54,768 INFO L432 NwaCegarLoop]: 109 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, 109 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-16 14:51:54,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:51:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-16 14:51:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-16 14:51:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 14:51:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2024-11-16 14:51:54,801 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 139 [2024-11-16 14:51:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:51:54,801 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2024-11-16 14:51:54,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 14:51:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2024-11-16 14:51:54,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 14:51:54,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:51:54,804 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:51:54,816 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-16 14:51:55,008 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-16 14:51:55,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:51:55,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:51:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1212893049, now seen corresponding path program 1 times [2024-11-16 14:51:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:51:55,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94027798] [2024-11-16 14:51:55,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:51:55,012 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-16 14:51:55,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:51:55,013 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-16 14:51:55,014 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-16 14:51:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:51:55,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 14:51:55,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:51:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 19 proven. 57 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-16 14:51:56,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:51:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:51:57,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:51:57,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94027798] [2024-11-16 14:51:57,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94027798] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 14:51:57,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 14:51:57,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-16 14:51:57,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326387042] [2024-11-16 14:51:57,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:51:57,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:51:57,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:51:57,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:51:57,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-16 14:51:57,187 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 14:51:58,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:52:00,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:52:02,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:52:02,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:02,685 INFO L93 Difference]: Finished difference Result 237 states and 354 transitions. [2024-11-16 14:52:02,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:52:02,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2024-11-16 14:52:02,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:02,689 INFO L225 Difference]: With dead ends: 237 [2024-11-16 14:52:02,689 INFO L226 Difference]: Without dead ends: 167 [2024-11-16 14:52:02,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-16 14:52:02,693 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 132 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:02,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 301 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-16 14:52:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-16 14:52:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2024-11-16 14:52:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 14:52:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2024-11-16 14:52:02,721 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 140 [2024-11-16 14:52:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:02,721 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2024-11-16 14:52:02,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 14:52:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2024-11-16 14:52:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 14:52:02,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:02,726 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:52:02,741 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 (3)] Forceful destruction successful, exit code 0 [2024-11-16 14:52:02,926 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-16 14:52:02,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:02,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1271356231, now seen corresponding path program 1 times [2024-11-16 14:52:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:52:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019744461] [2024-11-16 14:52:02,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:02,928 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-16 14:52:02,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:52:02,929 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-16 14:52:02,930 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-16 14:52:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:03,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 14:52:03,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:52:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:52:04,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:52:04,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:52:04,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019744461] [2024-11-16 14:52:04,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019744461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:52:04,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:52:04,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:52:04,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037271234] [2024-11-16 14:52:04,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:52:04,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:52:04,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:52:04,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:52:04,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:52:04,039 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:52:06,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:52:08,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:52:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:08,462 INFO L93 Difference]: Finished difference Result 369 states and 558 transitions. [2024-11-16 14:52:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 14:52:08,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-11-16 14:52:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:08,464 INFO L225 Difference]: With dead ends: 369 [2024-11-16 14:52:08,465 INFO L226 Difference]: Without dead ends: 226 [2024-11-16 14:52:08,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:52:08,466 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 86 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:08,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 354 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-16 14:52:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-16 14:52:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 197. [2024-11-16 14:52:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 133 states have (on average 1.3458646616541354) internal successors, (179), 133 states have internal predecessors, (179), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 14:52:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 299 transitions. [2024-11-16 14:52:08,495 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 299 transitions. Word has length 141 [2024-11-16 14:52:08,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:08,496 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 299 transitions. [2024-11-16 14:52:08,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:52:08,496 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 299 transitions. [2024-11-16 14:52:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 14:52:08,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:08,498 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:52:08,513 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-16 14:52:08,698 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-16 14:52:08,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:08,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1008719353, now seen corresponding path program 1 times [2024-11-16 14:52:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:52:08,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628976981] [2024-11-16 14:52:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:08,700 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-16 14:52:08,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:52:08,704 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-16 14:52:08,705 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-16 14:52:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:08,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 14:52:08,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:52:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 48 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2024-11-16 14:52:09,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:52:10,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:52:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628976981] [2024-11-16 14:52:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628976981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:52:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1030394177] [2024-11-16 14:52:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:10,248 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 14:52:10,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 14:52:10,250 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 14:52:10,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-16 14:52:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:11,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 14:52:11,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:52:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-16 14:52:11,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:52:11,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1030394177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:52:11,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:52:11,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 9 [2024-11-16 14:52:11,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283858035] [2024-11-16 14:52:11,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:52:11,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 14:52:11,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:52:11,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 14:52:11,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-11-16 14:52:11,848 INFO L87 Difference]: Start difference. First operand 197 states and 299 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-16 14:52:14,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:52:17,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:52:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:17,963 INFO L93 Difference]: Finished difference Result 469 states and 699 transitions. [2024-11-16 14:52:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 14:52:17,964 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 142 [2024-11-16 14:52:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:17,966 INFO L225 Difference]: With dead ends: 469 [2024-11-16 14:52:17,967 INFO L226 Difference]: Without dead ends: 317 [2024-11-16 14:52:17,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 420 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=462, Unknown=0, NotChecked=0, Total=702 [2024-11-16 14:52:17,972 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 194 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:17,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 431 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-16 14:52:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-16 14:52:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2024-11-16 14:52:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 202 states have (on average 1.301980198019802) internal successors, (263), 204 states have internal predecessors, (263), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-16 14:52:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 451 transitions. [2024-11-16 14:52:18,008 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 451 transitions. Word has length 142 [2024-11-16 14:52:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:18,009 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 451 transitions. [2024-11-16 14:52:18,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-16 14:52:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 451 transitions. [2024-11-16 14:52:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 14:52:18,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:18,010 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:52:18,026 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-16 14:52:18,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-16 14:52:18,411 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 14:52:18,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:18,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2036141214, now seen corresponding path program 1 times [2024-11-16 14:52:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:52:18,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368783793] [2024-11-16 14:52:18,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:18,412 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-16 14:52:18,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:52:18,413 INFO L229 MonitoredProcess]: Starting monitored process 7 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-16 14:52:18,415 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 (7)] Waiting until timeout for monitored process [2024-11-16 14:52:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:18,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 14:52:18,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:52:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:52:18,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:52:18,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:52:18,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368783793] [2024-11-16 14:52:18,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368783793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:52:18,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:52:18,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:52:18,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40962971] [2024-11-16 14:52:18,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:52:18,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:52:18,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:52:18,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:52:18,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:52:18,732 INFO L87 Difference]: Start difference. First operand 305 states and 451 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:52:20,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:52:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:20,803 INFO L93 Difference]: Finished difference Result 696 states and 1031 transitions. [2024-11-16 14:52:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:52:20,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-16 14:52:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:20,808 INFO L225 Difference]: With dead ends: 696 [2024-11-16 14:52:20,809 INFO L226 Difference]: Without dead ends: 468 [2024-11-16 14:52:20,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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-16 14:52:20,810 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 46 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:20,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 255 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-16 14:52:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-16 14:52:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 461. [2024-11-16 14:52:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 330 states have (on average 1.3212121212121213) internal successors, (436), 336 states have internal predecessors, (436), 118 states have call successors, (118), 12 states have call predecessors, (118), 12 states have return successors, (118), 112 states have call predecessors, (118), 118 states have call successors, (118) [2024-11-16 14:52:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 672 transitions. [2024-11-16 14:52:20,836 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 672 transitions. Word has length 143 [2024-11-16 14:52:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:20,837 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 672 transitions. [2024-11-16 14:52:20,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:52:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 672 transitions. [2024-11-16 14:52:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 14:52:20,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:20,843 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:52:20,858 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 (7)] Forceful destruction successful, exit code 0 [2024-11-16 14:52:21,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-16 14:52:21,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:21,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:21,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1969134461, now seen corresponding path program 1 times [2024-11-16 14:52:21,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:52:21,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492412219] [2024-11-16 14:52:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:21,045 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-16 14:52:21,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:52:21,046 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-16 14:52:21,047 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-16 14:52:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:21,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 14:52:21,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:52:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 14:52:22,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:52:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:52:22,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:52:22,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492412219] [2024-11-16 14:52:22,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492412219] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 14:52:22,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 14:52:22,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2024-11-16 14:52:22,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662480146] [2024-11-16 14:52:22,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:52:22,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:52:22,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:52:22,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:52:22,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-16 14:52:22,491 INFO L87 Difference]: Start difference. First operand 461 states and 672 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:52:23,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:52:26,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:52:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:52:26,366 INFO L93 Difference]: Finished difference Result 1005 states and 1459 transitions. [2024-11-16 14:52:26,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:52:26,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-16 14:52:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:52:26,371 INFO L225 Difference]: With dead ends: 1005 [2024-11-16 14:52:26,371 INFO L226 Difference]: Without dead ends: 642 [2024-11-16 14:52:26,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-16 14:52:26,374 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 33 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-16 14:52:26,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 252 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-16 14:52:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-16 14:52:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 479. [2024-11-16 14:52:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 348 states have (on average 1.3132183908045978) internal successors, (457), 354 states have internal predecessors, (457), 118 states have call successors, (118), 12 states have call predecessors, (118), 12 states have return successors, (118), 112 states have call predecessors, (118), 118 states have call successors, (118) [2024-11-16 14:52:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 693 transitions. [2024-11-16 14:52:26,406 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 693 transitions. Word has length 143 [2024-11-16 14:52:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:52:26,406 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 693 transitions. [2024-11-16 14:52:26,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:52:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 693 transitions. [2024-11-16 14:52:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 14:52:26,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:52:26,407 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:52:26,422 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-16 14:52:26,608 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-16 14:52:26,608 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:52:26,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:52:26,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2098217180, now seen corresponding path program 1 times [2024-11-16 14:52:26,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:52:26,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469002007] [2024-11-16 14:52:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:52:26,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:52:26,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:52:26,610 INFO L229 MonitoredProcess]: Starting monitored process 9 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-16 14:52:26,611 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 (9)] Waiting until timeout for monitored process [2024-11-16 14:52:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:52:26,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 14:52:26,887 INFO L278 TraceCheckSpWp]: Computing forward predicates...