./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.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 175c40674fb8455b1fc7ca299d32501cdcc37c8644c17a404e24211314abf953 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:48:24,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:48:24,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:48:24,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:48:24,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:48:24,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:48:24,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:48:24,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:48:24,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:48:24,907 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:48:24,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:48:24,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:48:24,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:48:24,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:48:24,913 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:48:24,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:48:24,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:48:24,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:48:24,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:48:24,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:48:24,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:48:24,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:48:24,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:48:24,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:48:24,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:48:24,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:48:24,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:48:24,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:48:24,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:48:24,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:48:24,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:48:24,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:48:24,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:48:24,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:48:24,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:48:24,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:48:24,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:48:24,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:48:24,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:48:24,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:48:24,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:48:24,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:48:24,922 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 -> 175c40674fb8455b1fc7ca299d32501cdcc37c8644c17a404e24211314abf953 [2024-10-24 11:48:25,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:48:25,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:48:25,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:48:25,142 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:48:25,142 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:48:25,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i [2024-10-24 11:48:26,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:48:26,573 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:48:26,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i [2024-10-24 11:48:26,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86bedd40b/59dec800e71a45c48fb0cf8de42b33d2/FLAGb21df9a51 [2024-10-24 11:48:26,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86bedd40b/59dec800e71a45c48fb0cf8de42b33d2 [2024-10-24 11:48:26,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:48:26,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:48:26,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:48:26,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:48:26,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:48:26,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:26,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22276c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26, skipping insertion in model container [2024-10-24 11:48:26,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:26,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:48:26,793 WARN L248 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_variablewrapping_wrapper-s_file-42.i[916,929] [2024-10-24 11:48:26,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:48:26,843 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:48:26,852 WARN L248 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_variablewrapping_wrapper-s_file-42.i[916,929] [2024-10-24 11:48:26,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:48:26,901 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:48:26,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26 WrapperNode [2024-10-24 11:48:26,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:48:26,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:48:26,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:48:26,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:48:26,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:26,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:26,956 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 434 [2024-10-24 11:48:26,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:48:26,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:48:26,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:48:26,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:48:26,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:26,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:26,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:26,988 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-24 11:48:26,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:26,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:27,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:27,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:27,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:27,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:27,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:48:27,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:48:27,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:48:27,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:48:27,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (1/1) ... [2024-10-24 11:48:27,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:48:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:48:27,064 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-10-24 11:48:27,067 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-10-24 11:48:27,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:48:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:48:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:48:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:48:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:48:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:48:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:48:27,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:48:27,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:48:27,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:48:27,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:48:27,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:48:27,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:48:27,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:48:27,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:48:27,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:48:27,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:48:27,196 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:48:27,197 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:48:27,583 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-24 11:48:27,583 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:48:27,614 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:48:27,615 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:48:27,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:27 BoogieIcfgContainer [2024-10-24 11:48:27,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:48:27,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:48:27,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:48:27,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:48:27,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:48:26" (1/3) ... [2024-10-24 11:48:27,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e5a076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:48:27, skipping insertion in model container [2024-10-24 11:48:27,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:26" (2/3) ... [2024-10-24 11:48:27,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e5a076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:48:27, skipping insertion in model container [2024-10-24 11:48:27,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:27" (3/3) ... [2024-10-24 11:48:27,622 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-42.i [2024-10-24 11:48:27,635 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:48:27,636 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:48:27,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:48:27,687 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;@4a0ed3e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:48:27,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:48:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:27,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:27,708 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:27,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:27,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2082484620, now seen corresponding path program 1 times [2024-10-24 11:48:27,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:27,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309946068] [2024-10-24 11:48:27,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:27,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:48:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:48:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:27,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:48:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:27,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:27,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:48:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:27,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:48:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:28,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:28,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309946068] [2024-10-24 11:48:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309946068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:28,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:28,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:48:28,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313670376] [2024-10-24 11:48:28,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:28,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:48:28,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:28,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:48:28,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:48:28,091 INFO L87 Difference]: Start difference. First operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:48:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:28,150 INFO L93 Difference]: Finished difference Result 183 states and 283 transitions. [2024-10-24 11:48:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:48:28,153 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-24 11:48:28,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:28,161 INFO L225 Difference]: With dead ends: 183 [2024-10-24 11:48:28,161 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:48:28,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-10-24 11:48:28,166 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:28,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:48:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-24 11:48:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-10-24 11:48:28,203 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 98 [2024-10-24 11:48:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:28,204 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-10-24 11:48:28,204 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:48:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-10-24 11:48:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:28,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:28,207 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:28,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:48:28,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:28,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:28,209 INFO L85 PathProgramCache]: Analyzing trace with hash 378438938, now seen corresponding path program 1 times [2024-10-24 11:48:28,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:28,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232513071] [2024-10-24 11:48:28,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:28,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:48:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:48:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:48:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:48:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:48:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:28,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:28,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232513071] [2024-10-24 11:48:28,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232513071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:28,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:28,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:48:28,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416975171] [2024-10-24 11:48:28,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:28,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:48:28,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:28,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:48:28,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:48:28,439 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:48:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:28,484 INFO L93 Difference]: Finished difference Result 183 states and 262 transitions. [2024-10-24 11:48:28,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:48:28,485 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), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-24 11:48:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:28,486 INFO L225 Difference]: With dead ends: 183 [2024-10-24 11:48:28,486 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:48:28,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-10-24 11:48:28,489 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:28,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:48:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:48:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-10-24 11:48:28,506 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 98 [2024-10-24 11:48:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:28,507 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-10-24 11:48:28,507 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), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:48:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-10-24 11:48:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:28,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:28,509 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:28,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:48:28,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:28,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2037397412, now seen corresponding path program 1 times [2024-10-24 11:48:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655216740] [2024-10-24 11:48:28,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:48:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:48:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:48:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:48:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:48:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:28,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:28,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655216740] [2024-10-24 11:48:28,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655216740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:28,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:28,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:48:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411522478] [2024-10-24 11:48:28,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:28,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:48:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:28,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:48:28,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:48:28,986 INFO L87 Difference]: Start difference. First operand 93 states and 132 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:29,090 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2024-10-24 11:48:29,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:48:29,091 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:29,092 INFO L225 Difference]: With dead ends: 185 [2024-10-24 11:48:29,092 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:48:29,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-10-24 11:48:29,093 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:29,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:48:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:48:29,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:48:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-10-24 11:48:29,104 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 98 [2024-10-24 11:48:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:29,104 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-10-24 11:48:29,105 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-10-24 11:48:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:29,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:29,106 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:29,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:48:29,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:29,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:29,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2123556378, now seen corresponding path program 1 times [2024-10-24 11:48:29,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:29,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219337908] [2024-10-24 11:48:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:29,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:29,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:48:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:29,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:48:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:48:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:29,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:48:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:29,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:48:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:29,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:29,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:29,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:29,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:29,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:29,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219337908] [2024-10-24 11:48:29,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219337908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:29,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:29,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:48:29,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115129248] [2024-10-24 11:48:29,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:29,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:48:29,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:29,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:48:29,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:48:29,402 INFO L87 Difference]: Start difference. First operand 93 states and 131 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:29,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:29,489 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. [2024-10-24 11:48:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:48:29,490 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:29,494 INFO L225 Difference]: With dead ends: 185 [2024-10-24 11:48:29,494 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:48:29,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-10-24 11:48:29,495 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:29,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:48:29,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:48:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:48:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-10-24 11:48:29,503 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 98 [2024-10-24 11:48:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:29,503 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-10-24 11:48:29,504 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-10-24 11:48:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:29,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:29,505 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:29,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:48:29,505 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:29,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:29,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1536750364, now seen corresponding path program 1 times [2024-10-24 11:48:29,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:29,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635836385] [2024-10-24 11:48:29,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:29,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:30,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:48:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:30,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:48:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:30,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:48:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:30,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:30,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:48:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:30,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:48:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:30,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:30,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:30,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:30,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:30,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:30,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:30,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635836385] [2024-10-24 11:48:30,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635836385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:30,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:30,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:48:30,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171735174] [2024-10-24 11:48:30,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:30,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:48:30,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:30,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:48:30,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:48:30,706 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:48:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:30,967 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2024-10-24 11:48:30,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:48:30,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-24 11:48:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:30,968 INFO L225 Difference]: With dead ends: 188 [2024-10-24 11:48:30,968 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 11:48:30,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:48:30,970 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 64 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:30,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 449 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:48:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 11:48:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-24 11:48:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-10-24 11:48:30,977 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 98 [2024-10-24 11:48:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:30,977 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-10-24 11:48:30,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:48:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-10-24 11:48:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:30,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:30,979 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:30,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:48:30,979 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:30,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:30,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1143723354, now seen corresponding path program 1 times [2024-10-24 11:48:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:30,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287706978] [2024-10-24 11:48:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:30,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:48:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:48:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:48:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:48:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:48:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 11:48:31,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287706978] [2024-10-24 11:48:31,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287706978] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:48:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477492486] [2024-10-24 11:48:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:31,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:48:31,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:48:31,700 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-10-24 11:48:31,701 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-10-24 11:48:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:31,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-24 11:48:31,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:31,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2024-10-24 11:48:31,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:31,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-10-24 11:48:31,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:31,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2024-10-24 11:48:32,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:32,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-10-24 11:48:32,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:32,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-10-24 11:48:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 11:48:32,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:48:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:32,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477492486] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:48:32,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:48:32,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 11] total 20 [2024-10-24 11:48:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832272844] [2024-10-24 11:48:32,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:32,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:48:32,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:32,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:48:32,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:48:32,254 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:32,566 INFO L93 Difference]: Finished difference Result 285 states and 397 transitions. [2024-10-24 11:48:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:48:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:32,569 INFO L225 Difference]: With dead ends: 285 [2024-10-24 11:48:32,569 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 11:48:32,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2024-10-24 11:48:32,570 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 110 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:32,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 766 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:48:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 11:48:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 115. [2024-10-24 11:48:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2024-10-24 11:48:32,577 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 98 [2024-10-24 11:48:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:32,577 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2024-10-24 11:48:32,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2024-10-24 11:48:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:32,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:32,578 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:32,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:48:32,782 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-10-24 11:48:32,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:32,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash -830495007, now seen corresponding path program 1 times [2024-10-24 11:48:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:32,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993513195] [2024-10-24 11:48:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:32,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:48:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:32,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:48:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:32,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:48:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:32,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:32,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:48:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:32,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:48:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:32,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:32,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:32,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:32,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:32,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:32,920 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:32,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:32,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993513195] [2024-10-24 11:48:32,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993513195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:32,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:32,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:48:32,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486751852] [2024-10-24 11:48:32,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:32,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:48:32,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:32,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:48:32,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:48:32,921 INFO L87 Difference]: Start difference. First operand 115 states and 160 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:32,992 INFO L93 Difference]: Finished difference Result 229 states and 319 transitions. [2024-10-24 11:48:32,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:48:32,993 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:32,995 INFO L225 Difference]: With dead ends: 229 [2024-10-24 11:48:32,995 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 11:48:32,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-10-24 11:48:32,996 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:32,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:48:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 11:48:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-24 11:48:33,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 159 transitions. [2024-10-24 11:48:33,008 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 159 transitions. Word has length 98 [2024-10-24 11:48:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:33,008 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 159 transitions. [2024-10-24 11:48:33,009 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2024-10-24 11:48:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:33,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:33,009 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:33,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:48:33,010 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:33,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:33,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1417301021, now seen corresponding path program 1 times [2024-10-24 11:48:33,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:33,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778128137] [2024-10-24 11:48:33,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:33,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:48:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:48:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:48:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:48:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:48:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:33,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:33,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778128137] [2024-10-24 11:48:33,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778128137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:33,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:33,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:48:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721764618] [2024-10-24 11:48:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:33,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:48:33,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:48:33,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:48:33,132 INFO L87 Difference]: Start difference. First operand 115 states and 159 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:33,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:33,144 INFO L93 Difference]: Finished difference Result 227 states and 315 transitions. [2024-10-24 11:48:33,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:48:33,144 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:33,146 INFO L225 Difference]: With dead ends: 227 [2024-10-24 11:48:33,146 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 11:48:33,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-10-24 11:48:33,147 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:33,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 11:48:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-24 11:48:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.33) internal successors, (133), 100 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2024-10-24 11:48:33,154 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 155 transitions. Word has length 98 [2024-10-24 11:48:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:33,154 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 155 transitions. [2024-10-24 11:48:33,155 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:33,155 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 155 transitions. [2024-10-24 11:48:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:33,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:33,158 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:33,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:48:33,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:33,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:33,159 INFO L85 PathProgramCache]: Analyzing trace with hash 782866803, now seen corresponding path program 1 times [2024-10-24 11:48:33,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:33,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231542834] [2024-10-24 11:48:33,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:33,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:48:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:48:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:48:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:48:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:48:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:33,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:33,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231542834] [2024-10-24 11:48:33,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231542834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:33,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:33,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:48:33,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582261537] [2024-10-24 11:48:33,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:33,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:48:33,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:33,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:48:33,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:48:33,279 INFO L87 Difference]: Start difference. First operand 113 states and 155 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:33,344 INFO L93 Difference]: Finished difference Result 225 states and 309 transitions. [2024-10-24 11:48:33,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:48:33,345 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:33,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:33,345 INFO L225 Difference]: With dead ends: 225 [2024-10-24 11:48:33,345 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 11:48:33,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-10-24 11:48:33,346 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:33,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:48:33,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 11:48:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-24 11:48:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2024-10-24 11:48:33,350 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 98 [2024-10-24 11:48:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:33,351 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2024-10-24 11:48:33,351 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2024-10-24 11:48:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:33,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:33,352 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:33,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:48:33,352 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:33,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:33,352 INFO L85 PathProgramCache]: Analyzing trace with hash 648853297, now seen corresponding path program 1 times [2024-10-24 11:48:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:33,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726023075] [2024-10-24 11:48:33,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:33,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:48:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:48:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:48:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:48:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:48:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:33,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:33,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726023075] [2024-10-24 11:48:33,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726023075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:33,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:33,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:48:33,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566810842] [2024-10-24 11:48:33,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:33,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:48:33,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:33,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:48:33,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:48:33,452 INFO L87 Difference]: Start difference. First operand 113 states and 154 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:33,462 INFO L93 Difference]: Finished difference Result 201 states and 274 transitions. [2024-10-24 11:48:33,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:48:33,462 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:33,463 INFO L225 Difference]: With dead ends: 201 [2024-10-24 11:48:33,463 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 11:48:33,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-10-24 11:48:33,464 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:33,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 11:48:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-24 11:48:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 76 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2024-10-24 11:48:33,467 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 98 [2024-10-24 11:48:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:33,468 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2024-10-24 11:48:33,468 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2024-10-24 11:48:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:48:33,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:33,468 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:33,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:48:33,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:33,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:33,469 INFO L85 PathProgramCache]: Analyzing trace with hash -465305983, now seen corresponding path program 1 times [2024-10-24 11:48:33,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:33,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108442893] [2024-10-24 11:48:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:33,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:48:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:48:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:48:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:48:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:48:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 11:48:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108442893] [2024-10-24 11:48:34,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108442893] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:48:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992313815] [2024-10-24 11:48:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:34,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:48:34,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:48:34,104 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-10-24 11:48:34,105 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-10-24 11:48:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:34,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 11:48:34,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:34,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-24 11:48:34,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 11:48:34,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 11:48:34,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 11:48:34,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:34,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-24 11:48:34,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:34,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-10-24 11:48:34,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:34,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 40 [2024-10-24 11:48:34,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:34,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-10-24 11:48:34,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:34,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 30 [2024-10-24 11:48:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-24 11:48:34,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:48:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 11:48:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992313815] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:48:34,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:48:34,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2024-10-24 11:48:34,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404801693] [2024-10-24 11:48:34,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:48:34,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:48:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:34,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:48:34,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:48:34,763 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 15 states, 12 states have (on average 8.0) internal successors, (96), 15 states have internal predecessors, (96), 7 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 7 states have call successors, (29) [2024-10-24 11:48:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:35,182 INFO L93 Difference]: Finished difference Result 186 states and 247 transitions. [2024-10-24 11:48:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:48:35,182 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.0) internal successors, (96), 15 states have internal predecessors, (96), 7 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 7 states have call successors, (29) Word has length 100 [2024-10-24 11:48:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:35,183 INFO L225 Difference]: With dead ends: 186 [2024-10-24 11:48:35,183 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 11:48:35,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 213 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2024-10-24 11:48:35,184 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 217 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:35,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 300 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:48:35,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 11:48:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-10-24 11:48:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2024-10-24 11:48:35,189 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 100 [2024-10-24 11:48:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:35,189 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2024-10-24 11:48:35,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.0) internal successors, (96), 15 states have internal predecessors, (96), 7 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 7 states have call successors, (29) [2024-10-24 11:48:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2024-10-24 11:48:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:48:35,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:35,192 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:35,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:48:35,395 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,SelfDestructingSolverStorable10 [2024-10-24 11:48:35,398 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:35,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:35,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1299005446, now seen corresponding path program 1 times [2024-10-24 11:48:35,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:35,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719611110] [2024-10-24 11:48:35,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:35,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:35,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:48:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:35,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:48:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:35,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:48:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:35,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:48:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:35,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:48:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:35,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:48:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:35,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:48:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:35,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:48:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:35,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:48:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:35,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:48:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:35,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:48:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:35,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:48:35,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719611110] [2024-10-24 11:48:35,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719611110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:35,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:35,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:48:35,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962195102] [2024-10-24 11:48:35,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:35,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:48:35,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:48:35,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:48:35,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:48:35,636 INFO L87 Difference]: Start difference. First operand 93 states and 122 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:35,806 INFO L93 Difference]: Finished difference Result 185 states and 243 transitions. [2024-10-24 11:48:35,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:48:35,807 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-24 11:48:35,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:35,812 INFO L225 Difference]: With dead ends: 185 [2024-10-24 11:48:35,813 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:48:35,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:48:35,813 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 99 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:35,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 226 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:48:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:48:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:48:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 79 states have internal predecessors, (99), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2024-10-24 11:48:35,818 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 100 [2024-10-24 11:48:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:35,818 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2024-10-24 11:48:35,818 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2024-10-24 11:48:35,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:48:35,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:35,819 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:35,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:48:35,819 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:35,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash 389938296, now seen corresponding path program 1 times [2024-10-24 11:48:35,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:48:35,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346554315] [2024-10-24 11:48:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:35,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:48:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:48:35,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:48:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:48:35,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:48:35,980 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:48:35,981 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:48:35,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:48:35,986 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:48:36,041 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:48:36,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:48:36 BoogieIcfgContainer [2024-10-24 11:48:36,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:48:36,045 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:48:36,045 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:48:36,045 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:48:36,045 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:27" (3/4) ... [2024-10-24 11:48:36,047 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:48:36,049 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:48:36,050 INFO L158 Benchmark]: Toolchain (without parser) took 9455.63ms. Allocated memory was 132.1MB in the beginning and 352.3MB in the end (delta: 220.2MB). Free memory was 63.3MB in the beginning and 249.1MB in the end (delta: -185.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-24 11:48:36,051 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:48:36,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.76ms. Allocated memory was 132.1MB in the beginning and 188.7MB in the end (delta: 56.6MB). Free memory was 63.0MB in the beginning and 150.1MB in the end (delta: -87.0MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-10-24 11:48:36,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.08ms. Allocated memory is still 188.7MB. Free memory was 150.1MB in the beginning and 145.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:48:36,051 INFO L158 Benchmark]: Boogie Preprocessor took 72.44ms. Allocated memory is still 188.7MB. Free memory was 145.9MB in the beginning and 141.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:48:36,052 INFO L158 Benchmark]: RCFGBuilder took 584.79ms. Allocated memory is still 188.7MB. Free memory was 140.6MB in the beginning and 105.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-24 11:48:36,052 INFO L158 Benchmark]: TraceAbstraction took 8427.95ms. Allocated memory was 188.7MB in the beginning and 352.3MB in the end (delta: 163.6MB). Free memory was 105.0MB in the beginning and 249.1MB in the end (delta: -144.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-10-24 11:48:36,052 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 352.3MB. Free memory is still 249.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:48:36,053 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.14ms. Allocated memory is still 132.1MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.76ms. Allocated memory was 132.1MB in the beginning and 188.7MB in the end (delta: 56.6MB). Free memory was 63.0MB in the beginning and 150.1MB in the end (delta: -87.0MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.08ms. Allocated memory is still 188.7MB. Free memory was 150.1MB in the beginning and 145.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.44ms. Allocated memory is still 188.7MB. Free memory was 145.9MB in the beginning and 141.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 584.79ms. Allocated memory is still 188.7MB. Free memory was 140.6MB in the beginning and 105.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8427.95ms. Allocated memory was 188.7MB in the beginning and 352.3MB in the end (delta: 163.6MB). Free memory was 105.0MB in the beginning and 249.1MB in the end (delta: -144.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 352.3MB. Free memory is still 249.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] FCALL updateLastVariables() [L106] CALL updateVariables() [L77] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L78] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L78] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L78] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L79] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L80] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L81] EXPR WrapperStruct00.var_1_11 [L81] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L81] EXPR WrapperStruct00.var_1_11 [L81] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L81] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L82] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L83] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L86] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] RET updateVariables() [L107] CALL step() [L52] EXPR WrapperStruct00.var_1_9 [L52] WrapperStruct00.var_1_8 = (WrapperStruct00.var_1_9 + 100) [L53] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L53] EXPR ((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f) [L53] EXPR WrapperStruct00.var_1_11 [L53] EXPR ((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f) VAL [WrapperStruct00={4:0}, isInitial=1] [L53] WrapperStruct00.var_1_10 = ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f))) [L54] EXPR WrapperStruct00.var_1_8 [L54] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L54] COND FALSE !(WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) [L57] EXPR WrapperStruct00.var_1_8 [L57] EXPR WrapperStruct00.var_1_8 [L57] EXPR WrapperStruct00.var_1_8 [L57] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L57] EXPR (((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) [L57] EXPR WrapperStruct00.var_1_8 [L57] EXPR WrapperStruct00.var_1_8 [L57] EXPR (((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L57] WrapperStruct00.var_1_1 = (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)))) [L59] EXPR WrapperStruct00.var_1_11 [L59] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L59] COND TRUE WrapperStruct00.var_1_11 <= WrapperStruct00.var_1_10 [L60] EXPR WrapperStruct00.var_1_1 [L60] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L60] COND TRUE WrapperStruct00.var_1_1 != WrapperStruct00.var_1_8 [L61] EXPR WrapperStruct00.var_1_18 [L61] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L70] EXPR WrapperStruct00.var_1_10 [L70] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] COND FALSE !((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) [L73] EXPR WrapperStruct00.var_1_1 [L73] EXPR WrapperStruct00.var_1_9 [L73] EXPR (WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L73] EXPR (WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16 [L73] EXPR WrapperStruct00.var_1_16 [L73] EXPR (WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L73] WrapperStruct00.var_1_12 = ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)))))) [L98] EXPR WrapperStruct00.var_1_1 [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR (((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR ((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR ((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100))) [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_9 [L98] EXPR ((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f))))) [L98] EXPR WrapperStruct00.var_1_10 [L98] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR ((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f) [L98] EXPR WrapperStruct00.var_1_11 [L98] EXPR ((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR ((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR ((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16))))) && ((WrapperStruct00.var_1_11 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_18)) : 1) : ((WrapperStruct00.var_1_8 <= 1000000) ? (WrapperStruct00.var_1_17 == ((unsigned char) 0)) : (WrapperStruct00.var_1_17 == ((unsigned char) 0)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16))))) && ((WrapperStruct00.var_1_11 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_18)) : 1) : ((WrapperStruct00.var_1_8 <= 1000000) ? (WrapperStruct00.var_1_17 == ((unsigned char) 0)) : (WrapperStruct00.var_1_17 == ((unsigned char) 0)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L98-L99] return (((((WrapperStruct00.var_1_8 > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8) < (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_8) : (WrapperStruct00.var_1_8))) - 10))) : (WrapperStruct00.var_1_1 == ((signed long int) (((((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) > ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))) ? ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_8 - WrapperStruct00.var_1_8))))))) && (WrapperStruct00.var_1_8 == ((unsigned char) (WrapperStruct00.var_1_9 + 100)))) && (WrapperStruct00.var_1_10 == ((float) ((((WrapperStruct00.var_1_11) < (64.15f)) ? (WrapperStruct00.var_1_11) : (64.15f)))))) && (((- WrapperStruct00.var_1_10) > WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || (WrapperStruct00.var_1_17 && (WrapperStruct00.var_1_15 || WrapperStruct00.var_1_16))))) : (WrapperStruct00.var_1_12 == ((unsigned char) ((WrapperStruct00.var_1_1 <= WrapperStruct00.var_1_9) && WrapperStruct00.var_1_16))))) && ((WrapperStruct00.var_1_11 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_1 != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_18)) : 1) : ((WrapperStruct00.var_1_8 <= 1000000) ? (WrapperStruct00.var_1_17 == ((unsigned char) 0)) : (WrapperStruct00.var_1_17 == ((unsigned char) 0)))) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 494 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 490 mSDsluCounter, 3912 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2644 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1959 IncrementalHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 1268 mSDtfsCounter, 1959 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 771 GetRequests, 690 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=6, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 82 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1478 NumberOfCodeBlocks, 1478 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1560 ConstructedInterpolants, 0 QuantifiedInterpolants, 4172 SizeOfPredicates, 11 NumberOfNonLiveVariables, 715 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 3418/3520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:48:36,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.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 175c40674fb8455b1fc7ca299d32501cdcc37c8644c17a404e24211314abf953 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:48:37,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:48:38,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:48:38,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:48:38,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:48:38,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:48:38,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:48:38,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:48:38,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:48:38,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:48:38,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:48:38,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:48:38,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:48:38,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:48:38,078 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:48:38,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:48:38,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:48:38,082 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:48:38,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:48:38,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:48:38,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:48:38,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:48:38,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:48:38,084 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:48:38,084 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:48:38,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:48:38,085 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:48:38,085 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:48:38,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:48:38,085 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:48:38,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:48:38,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:48:38,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:48:38,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:48:38,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:48:38,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:48:38,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:48:38,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:48:38,087 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:48:38,088 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:48:38,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:48:38,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:48:38,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:48:38,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:48:38,089 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:48:38,089 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 -> 175c40674fb8455b1fc7ca299d32501cdcc37c8644c17a404e24211314abf953 [2024-10-24 11:48:38,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:48:38,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:48:38,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:48:38,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:48:38,387 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:48:38,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i [2024-10-24 11:48:39,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:48:39,971 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:48:39,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-42.i [2024-10-24 11:48:39,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ed0916b/ed5fd2ae3d8240c29c2cbbb1b11ff9cc/FLAG07b716cec [2024-10-24 11:48:39,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ed0916b/ed5fd2ae3d8240c29c2cbbb1b11ff9cc [2024-10-24 11:48:39,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:48:39,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:48:40,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:48:40,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:48:40,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:48:40,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:48:39" (1/1) ... [2024-10-24 11:48:40,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c2acbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40, skipping insertion in model container [2024-10-24 11:48:40,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:48:39" (1/1) ... [2024-10-24 11:48:40,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:48:40,205 WARN L248 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_variablewrapping_wrapper-s_file-42.i[916,929] [2024-10-24 11:48:40,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:48:40,278 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:48:40,289 WARN L248 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_variablewrapping_wrapper-s_file-42.i[916,929] [2024-10-24 11:48:40,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:48:40,339 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:48:40,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40 WrapperNode [2024-10-24 11:48:40,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:48:40,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:48:40,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:48:40,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:48:40,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (1/1) ... [2024-10-24 11:48:40,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (1/1) ... [2024-10-24 11:48:40,406 INFO L138 Inliner]: procedures = 33, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 434 [2024-10-24 11:48:40,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:48:40,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:48:40,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:48:40,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:48:40,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (1/1) ... [2024-10-24 11:48:40,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (1/1) ... [2024-10-24 11:48:40,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (1/1) ... [2024-10-24 11:48:40,454 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-24 11:48:40,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (1/1) ... [2024-10-24 11:48:40,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (1/1) ... [2024-10-24 11:48:40,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (1/1) ... [2024-10-24 11:48:40,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (1/1) ... [2024-10-24 11:48:40,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (1/1) ... [2024-10-24 11:48:40,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (1/1) ... [2024-10-24 11:48:40,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:48:40,494 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:48:40,494 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:48:40,494 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:48:40,495 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (1/1) ... [2024-10-24 11:48:40,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:48:40,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:48:40,528 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-10-24 11:48:40,534 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-10-24 11:48:40,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:48:40,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:48:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:48:40,573 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:48:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:48:40,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:48:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:48:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:48:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:48:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:48:40,667 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:48:40,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:48:41,167 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-24 11:48:41,168 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:48:41,212 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:48:41,213 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:48:41,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:41 BoogieIcfgContainer [2024-10-24 11:48:41,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:48:41,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:48:41,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:48:41,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:48:41,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:48:39" (1/3) ... [2024-10-24 11:48:41,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6855dfb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:48:41, skipping insertion in model container [2024-10-24 11:48:41,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:48:40" (2/3) ... [2024-10-24 11:48:41,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6855dfb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:48:41, skipping insertion in model container [2024-10-24 11:48:41,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:48:41" (3/3) ... [2024-10-24 11:48:41,221 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-42.i [2024-10-24 11:48:41,235 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:48:41,236 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:48:41,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:48:41,299 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f4a4fca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:48:41,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:48:41,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:41,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:41,316 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:41,316 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:41,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:41,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2082484620, now seen corresponding path program 1 times [2024-10-24 11:48:41,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:41,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690196979] [2024-10-24 11:48:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:41,334 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-10-24 11:48:41,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:41,340 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-10-24 11:48:41,341 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-10-24 11:48:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:41,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:48:41,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-24 11:48:41,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:41,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:41,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690196979] [2024-10-24 11:48:41,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690196979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:41,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:41,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:48:41,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656099057] [2024-10-24 11:48:41,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:41,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:48:41,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:41,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:48:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:48:41,600 INFO L87 Difference]: Start difference. First operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:48:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:41,635 INFO L93 Difference]: Finished difference Result 183 states and 283 transitions. [2024-10-24 11:48:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:48:41,637 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-24 11:48:41,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:41,642 INFO L225 Difference]: With dead ends: 183 [2024-10-24 11:48:41,643 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:48:41,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-10-24 11:48:41,648 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:41,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:48:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-24 11:48:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-10-24 11:48:41,689 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 98 [2024-10-24 11:48:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:41,690 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-10-24 11:48:41,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:48:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-10-24 11:48:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:41,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:41,696 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:41,709 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-10-24 11:48:41,896 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-10-24 11:48:41,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:41,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:41,898 INFO L85 PathProgramCache]: Analyzing trace with hash 378438938, now seen corresponding path program 1 times [2024-10-24 11:48:41,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:41,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454319319] [2024-10-24 11:48:41,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:41,898 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-10-24 11:48:41,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:41,904 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-10-24 11:48:41,905 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-10-24 11:48:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:42,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:48:42,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-24 11:48:42,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:42,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:42,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454319319] [2024-10-24 11:48:42,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454319319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:42,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:42,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:48:42,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496814807] [2024-10-24 11:48:42,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:42,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:48:42,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:42,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:48:42,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:48:42,137 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:48:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:42,194 INFO L93 Difference]: Finished difference Result 183 states and 262 transitions. [2024-10-24 11:48:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:48:42,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-24 11:48:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:42,200 INFO L225 Difference]: With dead ends: 183 [2024-10-24 11:48:42,200 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:48:42,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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-10-24 11:48:42,201 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:42,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:48:42,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:48:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-10-24 11:48:42,210 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 98 [2024-10-24 11:48:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:42,212 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-10-24 11:48:42,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:48:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-10-24 11:48:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:42,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:42,215 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:42,224 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-10-24 11:48:42,416 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-10-24 11:48:42,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:42,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2037397412, now seen corresponding path program 1 times [2024-10-24 11:48:42,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:42,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396627950] [2024-10-24 11:48:42,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:42,419 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-10-24 11:48:42,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:42,422 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-10-24 11:48:42,424 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-10-24 11:48:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:42,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:48:42,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:42,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2024-10-24 11:48:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:42,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:42,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:42,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396627950] [2024-10-24 11:48:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396627950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:42,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:42,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:48:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948258998] [2024-10-24 11:48:42,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:42,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:48:42,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:42,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:48:42,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:48:42,708 INFO L87 Difference]: Start difference. First operand 93 states and 132 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:42,762 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2024-10-24 11:48:42,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:48:42,763 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:42,764 INFO L225 Difference]: With dead ends: 185 [2024-10-24 11:48:42,764 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:48:42,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-10-24 11:48:42,765 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:42,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:48:42,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:48:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-10-24 11:48:42,772 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 98 [2024-10-24 11:48:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:42,772 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-10-24 11:48:42,772 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:42,772 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-10-24 11:48:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:42,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:42,774 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:42,781 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 (4)] Ended with exit code 0 [2024-10-24 11:48:42,977 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-10-24 11:48:42,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:42,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2123556378, now seen corresponding path program 1 times [2024-10-24 11:48:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372293608] [2024-10-24 11:48:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:42,980 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-10-24 11:48:42,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:42,984 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-10-24 11:48:42,987 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-10-24 11:48:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:43,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:48:43,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:43,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2024-10-24 11:48:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:43,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:43,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372293608] [2024-10-24 11:48:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372293608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:43,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:43,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:48:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320791401] [2024-10-24 11:48:43,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:43,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:48:43,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:43,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:48:43,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:48:43,173 INFO L87 Difference]: Start difference. First operand 93 states and 131 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:43,209 INFO L93 Difference]: Finished difference Result 185 states and 261 transitions. [2024-10-24 11:48:43,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:48:43,209 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:43,210 INFO L225 Difference]: With dead ends: 185 [2024-10-24 11:48:43,210 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:48:43,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-10-24 11:48:43,212 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:43,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:43,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:48:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:48:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-10-24 11:48:43,217 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 98 [2024-10-24 11:48:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:43,218 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-10-24 11:48:43,218 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-10-24 11:48:43,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:43,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:43,221 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:43,227 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-10-24 11:48:43,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:43,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:43,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:43,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1536750364, now seen corresponding path program 1 times [2024-10-24 11:48:43,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:43,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656777811] [2024-10-24 11:48:43,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:43,423 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-10-24 11:48:43,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:43,425 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:48:43,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:48:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:43,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 11:48:43,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:43,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:48:43,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-24 11:48:43,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:43,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-24 11:48:43,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:43,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-24 11:48:44,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:44,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 65 [2024-10-24 11:48:44,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:44,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 68 [2024-10-24 11:48:44,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:44,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 68 [2024-10-24 11:48:44,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:44,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 79 [2024-10-24 11:48:44,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:44,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 43 [2024-10-24 11:48:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 146 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 11:48:44,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:48:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 11:48:44,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:44,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656777811] [2024-10-24 11:48:44,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656777811] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:48:44,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:48:44,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2024-10-24 11:48:44,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782259955] [2024-10-24 11:48:44,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:48:44,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:48:44,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:44,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:48:44,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:48:44,631 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 14 states, 12 states have (on average 6.333333333333333) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-24 11:48:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:45,720 INFO L93 Difference]: Finished difference Result 248 states and 339 transitions. [2024-10-24 11:48:45,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 11:48:45,721 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.333333333333333) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 98 [2024-10-24 11:48:45,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:45,722 INFO L225 Difference]: With dead ends: 248 [2024-10-24 11:48:45,722 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 11:48:45,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:48:45,724 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 494 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:45,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 279 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:48:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 11:48:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 101. [2024-10-24 11:48:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2024-10-24 11:48:45,737 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 98 [2024-10-24 11:48:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:45,737 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2024-10-24 11:48:45,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.333333333333333) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-24 11:48:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2024-10-24 11:48:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:45,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:45,738 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:45,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 11:48:45,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:48:45,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:45,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash -747913515, now seen corresponding path program 1 times [2024-10-24 11:48:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:45,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450430772] [2024-10-24 11:48:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:45,940 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-10-24 11:48:45,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:45,941 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-10-24 11:48:45,942 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-10-24 11:48:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:46,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 11:48:46,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:46,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:48:46,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 11:48:46,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-24 11:48:46,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:46,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-24 11:48:46,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:46,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-24 11:48:46,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:46,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-24 11:48:46,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:46,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 69 [2024-10-24 11:48:46,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:46,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 72 [2024-10-24 11:48:46,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:46,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 72 [2024-10-24 11:48:46,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:46,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 83 [2024-10-24 11:48:47,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:47,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 86 [2024-10-24 11:48:47,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:47,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 133 treesize of output 61 [2024-10-24 11:48:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 160 proven. 27 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-24 11:48:47,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:48:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:47,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:47,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450430772] [2024-10-24 11:48:47,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450430772] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:48:47,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:48:47,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 14 [2024-10-24 11:48:47,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137987097] [2024-10-24 11:48:47,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:47,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:48:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:47,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:48:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:48:47,509 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:47,740 INFO L93 Difference]: Finished difference Result 204 states and 273 transitions. [2024-10-24 11:48:47,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:48:47,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:47,742 INFO L225 Difference]: With dead ends: 204 [2024-10-24 11:48:47,742 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 11:48:47,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:48:47,743 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 63 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:47,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 259 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:48:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 11:48:47,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-24 11:48:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2024-10-24 11:48:47,751 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 98 [2024-10-24 11:48:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:47,751 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2024-10-24 11:48:47,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2024-10-24 11:48:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:47,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:47,752 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:47,758 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-10-24 11:48:47,952 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-10-24 11:48:47,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:47,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1140940525, now seen corresponding path program 1 times [2024-10-24 11:48:47,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:47,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912379578] [2024-10-24 11:48:47,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:47,954 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-10-24 11:48:47,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:47,956 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-10-24 11:48:47,957 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-10-24 11:48:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:48,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-24 11:48:48,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:48,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:48:48,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 11:48:48,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 11:48:48,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 11:48:48,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-24 11:48:48,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:48,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-24 11:48:48,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:48,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2024-10-24 11:48:48,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:48,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 46 [2024-10-24 11:48:48,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:48,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 60 [2024-10-24 11:48:48,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:48,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 83 [2024-10-24 11:48:48,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:48,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 123 treesize of output 51 [2024-10-24 11:48:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 128 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-24 11:48:48,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:48:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:48,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:48,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912379578] [2024-10-24 11:48:48,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912379578] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:48:48,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:48:48,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2024-10-24 11:48:48,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131048600] [2024-10-24 11:48:48,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:48,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:48:48,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:48,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:48:48,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:48:48,818 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:49,104 INFO L93 Difference]: Finished difference Result 259 states and 347 transitions. [2024-10-24 11:48:49,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:48:49,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:49,109 INFO L225 Difference]: With dead ends: 259 [2024-10-24 11:48:49,109 INFO L226 Difference]: Without dead ends: 157 [2024-10-24 11:48:49,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:48:49,110 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 63 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:49,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 305 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:48:49,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-24 11:48:49,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2024-10-24 11:48:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 95 states have internal predecessors, (125), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:48:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 147 transitions. [2024-10-24 11:48:49,120 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 147 transitions. Word has length 98 [2024-10-24 11:48:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:49,121 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 147 transitions. [2024-10-24 11:48:49,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 147 transitions. [2024-10-24 11:48:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:49,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:49,122 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:49,135 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 (8)] Ended with exit code 0 [2024-10-24 11:48:49,322 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-10-24 11:48:49,323 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:49,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:49,323 INFO L85 PathProgramCache]: Analyzing trace with hash 447407377, now seen corresponding path program 1 times [2024-10-24 11:48:49,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:49,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396011438] [2024-10-24 11:48:49,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:49,324 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-10-24 11:48:49,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:49,325 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-10-24 11:48:49,326 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-10-24 11:48:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:49,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:48:49,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:49,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:48:49,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-10-24 11:48:49,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:49,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 47 [2024-10-24 11:48:49,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:49,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 50 [2024-10-24 11:48:49,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:49,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 29 [2024-10-24 11:48:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:49,629 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:49,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396011438] [2024-10-24 11:48:49,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396011438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:49,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:49,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:48:49,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891979492] [2024-10-24 11:48:49,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:49,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:48:49,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:49,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:48:49,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:48:49,631 INFO L87 Difference]: Start difference. First operand 110 states and 147 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:50,506 INFO L93 Difference]: Finished difference Result 403 states and 534 transitions. [2024-10-24 11:48:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:48:50,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:50,509 INFO L225 Difference]: With dead ends: 403 [2024-10-24 11:48:50,509 INFO L226 Difference]: Without dead ends: 294 [2024-10-24 11:48:50,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:48:50,510 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 275 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:50,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 684 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:48:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-24 11:48:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 176. [2024-10-24 11:48:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 157 states have (on average 1.3248407643312101) internal successors, (208), 158 states have internal predecessors, (208), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:48:50,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 236 transitions. [2024-10-24 11:48:50,525 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 236 transitions. Word has length 98 [2024-10-24 11:48:50,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:50,525 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 236 transitions. [2024-10-24 11:48:50,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 236 transitions. [2024-10-24 11:48:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:50,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:50,526 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:50,540 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 (9)] Ended with exit code 0 [2024-10-24 11:48:50,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-10-24 11:48:50,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:50,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:50,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1526810984, now seen corresponding path program 1 times [2024-10-24 11:48:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:50,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174933799] [2024-10-24 11:48:50,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:50,728 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-10-24 11:48:50,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:50,731 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10-24 11:48:50,731 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 (10)] Waiting until timeout for monitored process [2024-10-24 11:48:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:50,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:48:50,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:50,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:48:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:50,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:50,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:50,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174933799] [2024-10-24 11:48:50,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174933799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:50,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:50,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:48:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015024970] [2024-10-24 11:48:50,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:50,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:48:50,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:50,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:48:50,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:48:50,878 INFO L87 Difference]: Start difference. First operand 176 states and 236 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:50,910 INFO L93 Difference]: Finished difference Result 343 states and 459 transitions. [2024-10-24 11:48:50,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:48:50,910 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:50,913 INFO L225 Difference]: With dead ends: 343 [2024-10-24 11:48:50,913 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 11:48:50,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-10-24 11:48:50,914 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:50,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 11:48:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-24 11:48:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 149 states have (on average 1.3020134228187918) internal successors, (194), 150 states have internal predecessors, (194), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:48:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 222 transitions. [2024-10-24 11:48:50,925 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 222 transitions. Word has length 98 [2024-10-24 11:48:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:50,925 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 222 transitions. [2024-10-24 11:48:50,925 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2024-10-24 11:48:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:50,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:50,926 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:50,932 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 (10)] Forceful destruction successful, exit code 0 [2024-10-24 11:48:51,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-10-24 11:48:51,127 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:51,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:51,127 INFO L85 PathProgramCache]: Analyzing trace with hash -370241073, now seen corresponding path program 1 times [2024-10-24 11:48:51,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:51,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819129390] [2024-10-24 11:48:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:51,128 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-10-24 11:48:51,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:51,130 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10-24 11:48:51,131 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 (11)] Waiting until timeout for monitored process [2024-10-24 11:48:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:51,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:48:51,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:51,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:48:51,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-10-24 11:48:51,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:51,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 27 [2024-10-24 11:48:51,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:51,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 24 [2024-10-24 11:48:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:51,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:51,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819129390] [2024-10-24 11:48:51,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819129390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:51,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:51,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:48:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105981478] [2024-10-24 11:48:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:51,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:48:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:51,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:48:51,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:48:51,370 INFO L87 Difference]: Start difference. First operand 168 states and 222 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:51,992 INFO L93 Difference]: Finished difference Result 426 states and 561 transitions. [2024-10-24 11:48:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:48:51,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:51,994 INFO L225 Difference]: With dead ends: 426 [2024-10-24 11:48:51,994 INFO L226 Difference]: Without dead ends: 259 [2024-10-24 11:48:51,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:48:51,995 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 98 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:51,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 786 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:48:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-24 11:48:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 181. [2024-10-24 11:48:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 163 states have internal predecessors, (209), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:48:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 237 transitions. [2024-10-24 11:48:52,008 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 237 transitions. Word has length 98 [2024-10-24 11:48:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:52,009 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 237 transitions. [2024-10-24 11:48:52,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 237 transitions. [2024-10-24 11:48:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 11:48:52,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:52,009 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:52,016 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 (11)] Forceful destruction successful, exit code 0 [2024-10-24 11:48:52,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-10-24 11:48:52,210 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:52,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:52,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1501797076, now seen corresponding path program 1 times [2024-10-24 11:48:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288558758] [2024-10-24 11:48:52,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:52,211 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-10-24 11:48:52,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:52,212 INFO L229 MonitoredProcess]: Starting monitored process 12 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-10-24 11:48:52,213 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 (12)] Waiting until timeout for monitored process [2024-10-24 11:48:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:52,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:48:52,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:52,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:48:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:48:52,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:52,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:52,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288558758] [2024-10-24 11:48:52,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288558758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:52,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:52,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:48:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55684705] [2024-10-24 11:48:52,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:52,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:48:52,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:52,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:48:52,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:48:52,352 INFO L87 Difference]: Start difference. First operand 181 states and 237 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:52,382 INFO L93 Difference]: Finished difference Result 337 states and 440 transitions. [2024-10-24 11:48:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:48:52,383 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-24 11:48:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:52,386 INFO L225 Difference]: With dead ends: 337 [2024-10-24 11:48:52,386 INFO L226 Difference]: Without dead ends: 157 [2024-10-24 11:48:52,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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-10-24 11:48:52,387 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:52,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:48:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-24 11:48:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-24 11:48:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 138 states have (on average 1.2681159420289856) internal successors, (175), 139 states have internal predecessors, (175), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:48:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2024-10-24 11:48:52,396 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 98 [2024-10-24 11:48:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:52,396 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2024-10-24 11:48:52,396 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:48:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2024-10-24 11:48:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:48:52,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:52,397 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:52,406 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 (12)] Ended with exit code 0 [2024-10-24 11:48:52,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-10-24 11:48:52,597 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:52,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash 389938296, now seen corresponding path program 1 times [2024-10-24 11:48:52,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:52,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648653388] [2024-10-24 11:48:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:52,598 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-10-24 11:48:52,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:52,599 INFO L229 MonitoredProcess]: Starting monitored process 13 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-10-24 11:48:52,603 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 (13)] Waiting until timeout for monitored process [2024-10-24 11:48:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:52,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-24 11:48:52,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:52,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:48:52,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-10-24 11:48:53,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:53,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57 [2024-10-24 11:48:53,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:53,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 70 [2024-10-24 11:48:53,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:53,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 83 [2024-10-24 11:48:54,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110 [2024-10-24 11:48:54,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:54,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 192 treesize of output 146 [2024-10-24 11:48:54,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:54,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 188 treesize of output 137 [2024-10-24 11:48:54,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:54,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 194 treesize of output 148 [2024-10-24 11:48:54,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:54,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 244 treesize of output 88 [2024-10-24 11:48:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 11:48:54,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:48:54,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:54,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648653388] [2024-10-24 11:48:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648653388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:48:54,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:48:54,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:48:54,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874928780] [2024-10-24 11:48:54,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:48:54,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 11:48:54,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:54,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 11:48:54,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:48:54,765 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-24 11:48:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:57,593 INFO L93 Difference]: Finished difference Result 465 states and 593 transitions. [2024-10-24 11:48:57,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 11:48:57,595 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 100 [2024-10-24 11:48:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:57,596 INFO L225 Difference]: With dead ends: 465 [2024-10-24 11:48:57,596 INFO L226 Difference]: Without dead ends: 309 [2024-10-24 11:48:57,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:48:57,597 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 388 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:57,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 603 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 11:48:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-24 11:48:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 298. [2024-10-24 11:48:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.25) internal successors, (325), 263 states have internal predecessors, (325), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:48:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 379 transitions. [2024-10-24 11:48:57,627 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 379 transitions. Word has length 100 [2024-10-24 11:48:57,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:57,628 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 379 transitions. [2024-10-24 11:48:57,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-24 11:48:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 379 transitions. [2024-10-24 11:48:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:48:57,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:57,629 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:57,636 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 (13)] Ended with exit code 0 [2024-10-24 11:48:57,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-10-24 11:48:57,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:57,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:57,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1091858256, now seen corresponding path program 1 times [2024-10-24 11:48:57,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:57,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324533641] [2024-10-24 11:48:57,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:57,830 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-10-24 11:48:57,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:57,832 INFO L229 MonitoredProcess]: Starting monitored process 14 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-10-24 11:48:57,832 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 (14)] Waiting until timeout for monitored process [2024-10-24 11:48:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:57,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:48:57,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:58,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 43 [2024-10-24 11:48:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-24 11:48:58,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:48:58,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 25 [2024-10-24 11:48:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 11:48:58,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:48:58,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324533641] [2024-10-24 11:48:58,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324533641] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:48:58,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:48:58,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-24 11:48:58,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726269384] [2024-10-24 11:48:58,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:48:58,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:48:58,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:48:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:48:58,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:48:58,163 INFO L87 Difference]: Start difference. First operand 298 states and 379 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 11:48:58,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:48:58,715 INFO L93 Difference]: Finished difference Result 631 states and 797 transitions. [2024-10-24 11:48:58,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:48:58,716 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 102 [2024-10-24 11:48:58,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:48:58,718 INFO L225 Difference]: With dead ends: 631 [2024-10-24 11:48:58,719 INFO L226 Difference]: Without dead ends: 312 [2024-10-24 11:48:58,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:48:58,720 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 112 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:48:58,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 527 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:48:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-24 11:48:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 294. [2024-10-24 11:48:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.23828125) internal successors, (317), 259 states have internal predecessors, (317), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:48:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 371 transitions. [2024-10-24 11:48:58,744 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 371 transitions. Word has length 102 [2024-10-24 11:48:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:48:58,744 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 371 transitions. [2024-10-24 11:48:58,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2024-10-24 11:48:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 371 transitions. [2024-10-24 11:48:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:48:58,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:48:58,745 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:48:58,751 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 (14)] Forceful destruction successful, exit code 0 [2024-10-24 11:48:58,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-10-24 11:48:58,945 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:48:58,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:48:58,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1493130011, now seen corresponding path program 1 times [2024-10-24 11:48:58,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:48:58,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253676580] [2024-10-24 11:48:58,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:48:58,946 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-10-24 11:48:58,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:48:58,949 INFO L229 MonitoredProcess]: Starting monitored process 15 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-10-24 11:48:58,950 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 (15)] Waiting until timeout for monitored process [2024-10-24 11:48:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:48:59,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-24 11:48:59,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:48:59,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:48:59,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-10-24 11:48:59,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:59,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57 [2024-10-24 11:48:59,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:59,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 70 [2024-10-24 11:48:59,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:48:59,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 83 [2024-10-24 11:49:00,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110 [2024-10-24 11:49:00,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:00,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 192 treesize of output 146 [2024-10-24 11:49:00,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:00,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 188 treesize of output 137 [2024-10-24 11:49:00,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:00,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 194 treesize of output 148 [2024-10-24 11:49:01,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 175 [2024-10-24 11:49:01,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:49:01,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:01,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 175 treesize of output 241 [2024-10-24 11:49:01,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:49:01,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:49:01,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 47 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 99 [2024-10-24 11:49:02,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:02,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 475 treesize of output 181 [2024-10-24 11:49:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 11:49:03,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:03,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253676580] [2024-10-24 11:49:03,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253676580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:03,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:03,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-24 11:49:03,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064980654] [2024-10-24 11:49:03,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:03,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 11:49:03,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:03,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 11:49:03,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:49:03,095 INFO L87 Difference]: Start difference. First operand 294 states and 371 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-24 11:49:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:06,535 INFO L93 Difference]: Finished difference Result 593 states and 745 transitions. [2024-10-24 11:49:06,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 11:49:06,536 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 102 [2024-10-24 11:49:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:06,538 INFO L225 Difference]: With dead ends: 593 [2024-10-24 11:49:06,538 INFO L226 Difference]: Without dead ends: 300 [2024-10-24 11:49:06,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:49:06,539 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 446 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:06,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 780 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-24 11:49:06,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-24 11:49:06,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2024-10-24 11:49:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.23046875) internal successors, (315), 259 states have internal predecessors, (315), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:49:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 369 transitions. [2024-10-24 11:49:06,558 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 369 transitions. Word has length 102 [2024-10-24 11:49:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:06,559 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 369 transitions. [2024-10-24 11:49:06,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-24 11:49:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 369 transitions. [2024-10-24 11:49:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:49:06,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:06,560 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:06,566 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 (15)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:06,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-10-24 11:49:06,760 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:06,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1627143517, now seen corresponding path program 1 times [2024-10-24 11:49:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:06,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271998337] [2024-10-24 11:49:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:06,761 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-10-24 11:49:06,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:06,763 INFO L229 MonitoredProcess]: Starting monitored process 16 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-10-24 11:49:06,763 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 (16)] Waiting until timeout for monitored process [2024-10-24 11:49:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:06,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-24 11:49:06,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:06,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:49:06,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 11:49:06,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 11:49:06,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-24 11:49:07,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:07,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-24 11:49:07,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:07,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-24 11:49:07,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:07,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2024-10-24 11:49:07,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:07,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-10-24 11:49:07,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:07,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 73 [2024-10-24 11:49:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 152 proven. 27 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-24 11:49:07,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 11:49:07,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:07,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271998337] [2024-10-24 11:49:07,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271998337] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:49:07,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:49:07,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2024-10-24 11:49:07,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774345673] [2024-10-24 11:49:07,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:49:07,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 11:49:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 11:49:07,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:49:07,848 INFO L87 Difference]: Start difference. First operand 294 states and 369 transitions. Second operand has 23 states, 21 states have (on average 4.809523809523809) internal successors, (101), 23 states have internal predecessors, (101), 7 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 7 states have call successors, (21) [2024-10-24 11:49:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:09,913 INFO L93 Difference]: Finished difference Result 727 states and 884 transitions. [2024-10-24 11:49:09,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-24 11:49:09,913 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.809523809523809) internal successors, (101), 23 states have internal predecessors, (101), 7 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 7 states have call successors, (21) Word has length 102 [2024-10-24 11:49:09,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:09,915 INFO L225 Difference]: With dead ends: 727 [2024-10-24 11:49:09,915 INFO L226 Difference]: Without dead ends: 434 [2024-10-24 11:49:09,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=2197, Unknown=0, NotChecked=0, Total=2756 [2024-10-24 11:49:09,917 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 87 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:09,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 526 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 11:49:09,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-24 11:49:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 172. [2024-10-24 11:49:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 141 states have (on average 1.1418439716312057) internal successors, (161), 141 states have internal predecessors, (161), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions. [2024-10-24 11:49:09,939 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 102 [2024-10-24 11:49:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:09,939 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 201 transitions. [2024-10-24 11:49:09,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.809523809523809) internal successors, (101), 23 states have internal predecessors, (101), 7 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 5 states have call predecessors, (21), 7 states have call successors, (21) [2024-10-24 11:49:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2024-10-24 11:49:09,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:49:09,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:09,940 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:09,949 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 (16)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:10,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-10-24 11:49:10,141 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:10,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:10,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1466989595, now seen corresponding path program 1 times [2024-10-24 11:49:10,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:10,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137228271] [2024-10-24 11:49:10,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:10,142 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-10-24 11:49:10,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:10,143 INFO L229 MonitoredProcess]: Starting monitored process 17 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-10-24 11:49:10,143 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 (17)] Waiting until timeout for monitored process [2024-10-24 11:49:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:10,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 11:49:10,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:10,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:49:10,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-24 11:49:10,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-24 11:49:10,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-24 11:49:10,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-10-24 11:49:10,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 71 [2024-10-24 11:49:11,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:11,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 107 [2024-10-24 11:49:11,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:11,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 158 treesize of output 98 [2024-10-24 11:49:11,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:11,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 197 treesize of output 71 [2024-10-24 11:49:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-24 11:49:11,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:11,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:11,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137228271] [2024-10-24 11:49:11,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137228271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:11,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:11,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:49:11,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473005638] [2024-10-24 11:49:11,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:11,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:49:11,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:11,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:49:11,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:49:11,271 INFO L87 Difference]: Start difference. First operand 172 states and 201 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 11:49:13,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:13,038 INFO L93 Difference]: Finished difference Result 372 states and 439 transitions. [2024-10-24 11:49:13,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:49:13,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2024-10-24 11:49:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:13,040 INFO L225 Difference]: With dead ends: 372 [2024-10-24 11:49:13,040 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 11:49:13,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:49:13,041 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 274 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:13,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 408 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 11:49:13,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 11:49:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 169. [2024-10-24 11:49:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2024-10-24 11:49:13,067 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 102 [2024-10-24 11:49:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:13,067 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2024-10-24 11:49:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 11:49:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2024-10-24 11:49:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:49:13,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:13,068 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:13,075 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 (17)] Ended with exit code 0 [2024-10-24 11:49:13,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-10-24 11:49:13,268 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:13,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:13,269 INFO L85 PathProgramCache]: Analyzing trace with hash -97164558, now seen corresponding path program 1 times [2024-10-24 11:49:13,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:13,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239763318] [2024-10-24 11:49:13,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:13,269 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-10-24 11:49:13,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:13,270 INFO L229 MonitoredProcess]: Starting monitored process 18 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-10-24 11:49:13,271 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 (18)] Waiting until timeout for monitored process [2024-10-24 11:49:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:13,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-24 11:49:13,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:13,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:49:13,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2024-10-24 11:49:13,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:13,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 34 [2024-10-24 11:49:13,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:13,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2024-10-24 11:49:14,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:14,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 57 [2024-10-24 11:49:14,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2024-10-24 11:49:14,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:14,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 180 treesize of output 131 [2024-10-24 11:49:14,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:14,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 176 treesize of output 122 [2024-10-24 11:49:14,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:14,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 182 treesize of output 133 [2024-10-24 11:49:15,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:15,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 192 treesize of output 137 [2024-10-24 11:49:15,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:15,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 227 treesize of output 83 [2024-10-24 11:49:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 158 proven. 24 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 11:49:15,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:49:16,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:16,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239763318] [2024-10-24 11:49:16,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239763318] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:49:16,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:49:16,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 23 [2024-10-24 11:49:16,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739636981] [2024-10-24 11:49:16,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:16,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:49:16,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:16,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:49:16,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:49:16,090 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:17,389 INFO L93 Difference]: Finished difference Result 407 states and 481 transitions. [2024-10-24 11:49:17,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:49:17,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-24 11:49:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:17,391 INFO L225 Difference]: With dead ends: 407 [2024-10-24 11:49:17,391 INFO L226 Difference]: Without dead ends: 239 [2024-10-24 11:49:17,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2024-10-24 11:49:17,392 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 62 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:17,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 419 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 11:49:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-24 11:49:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 196. [2024-10-24 11:49:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 165 states have (on average 1.1454545454545455) internal successors, (189), 165 states have internal predecessors, (189), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2024-10-24 11:49:17,414 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 102 [2024-10-24 11:49:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:17,415 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2024-10-24 11:49:17,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2024-10-24 11:49:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:49:17,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:17,416 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:17,423 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 (18)] Ended with exit code 0 [2024-10-24 11:49:17,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-10-24 11:49:17,616 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:17,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:17,617 INFO L85 PathProgramCache]: Analyzing trace with hash 582893812, now seen corresponding path program 1 times [2024-10-24 11:49:17,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:17,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942233765] [2024-10-24 11:49:17,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:17,617 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-10-24 11:49:17,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:17,618 INFO L229 MonitoredProcess]: Starting monitored process 19 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-10-24 11:49:17,619 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 (19)] Waiting until timeout for monitored process [2024-10-24 11:49:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:17,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 11:49:17,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:17,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:49:17,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:49:17,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-24 11:49:17,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:17,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-24 11:49:18,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:18,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-10-24 11:49:18,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2024-10-24 11:49:18,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:18,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 100 treesize of output 87 [2024-10-24 11:49:18,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:18,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 87 [2024-10-24 11:49:18,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:18,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 102 treesize of output 107 [2024-10-24 11:49:18,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:18,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 117 treesize of output 110 [2024-10-24 11:49:18,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:18,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 125 treesize of output 47 [2024-10-24 11:49:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-24 11:49:18,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:18,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942233765] [2024-10-24 11:49:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942233765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:18,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:18,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:49:18,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261541750] [2024-10-24 11:49:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:18,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:49:18,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:49:18,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:49:18,995 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 11:49:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:20,657 INFO L93 Difference]: Finished difference Result 461 states and 547 transitions. [2024-10-24 11:49:20,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:49:20,661 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2024-10-24 11:49:20,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:20,662 INFO L225 Difference]: With dead ends: 461 [2024-10-24 11:49:20,663 INFO L226 Difference]: Without dead ends: 266 [2024-10-24 11:49:20,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:49:20,663 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 267 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 20 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:20,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 207 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 377 Invalid, 2 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 11:49:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-24 11:49:20,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 181. [2024-10-24 11:49:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 150 states have (on average 1.14) internal successors, (171), 150 states have internal predecessors, (171), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 211 transitions. [2024-10-24 11:49:20,698 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 211 transitions. Word has length 102 [2024-10-24 11:49:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:20,699 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 211 transitions. [2024-10-24 11:49:20,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 11:49:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 211 transitions. [2024-10-24 11:49:20,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:49:20,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:20,700 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:20,709 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 (19)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:20,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-10-24 11:49:20,901 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:20,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:20,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1289038836, now seen corresponding path program 1 times [2024-10-24 11:49:20,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:20,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130557538] [2024-10-24 11:49:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:20,902 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-10-24 11:49:20,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:20,903 INFO L229 MonitoredProcess]: Starting monitored process 20 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-10-24 11:49:20,904 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 (20)] Waiting until timeout for monitored process [2024-10-24 11:49:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:21,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 11:49:21,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:21,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:49:21,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:49:21,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-24 11:49:21,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-24 11:49:21,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:21,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-24 11:49:21,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2024-10-24 11:49:21,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 88 [2024-10-24 11:49:21,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:21,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 126 treesize of output 108 [2024-10-24 11:49:21,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:21,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 183 treesize of output 134 [2024-10-24 11:49:22,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:22,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 138 [2024-10-24 11:49:22,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:22,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 201 treesize of output 75 [2024-10-24 11:49:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-24 11:49:22,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:22,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:22,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130557538] [2024-10-24 11:49:22,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130557538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:22,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:22,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:49:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327083954] [2024-10-24 11:49:22,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:22,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:49:22,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:22,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:49:22,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:49:22,493 INFO L87 Difference]: Start difference. First operand 181 states and 211 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 11:49:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:24,410 INFO L93 Difference]: Finished difference Result 431 states and 512 transitions. [2024-10-24 11:49:24,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:49:24,411 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2024-10-24 11:49:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:24,412 INFO L225 Difference]: With dead ends: 431 [2024-10-24 11:49:24,412 INFO L226 Difference]: Without dead ends: 251 [2024-10-24 11:49:24,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:49:24,413 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 420 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:24,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 366 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 11:49:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-24 11:49:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 200. [2024-10-24 11:49:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 169 states have (on average 1.1420118343195267) internal successors, (193), 169 states have internal predecessors, (193), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2024-10-24 11:49:24,440 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 233 transitions. Word has length 102 [2024-10-24 11:49:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:24,440 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 233 transitions. [2024-10-24 11:49:24,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 11:49:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 233 transitions. [2024-10-24 11:49:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:49:24,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:24,441 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:24,451 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 (20)] Ended with exit code 0 [2024-10-24 11:49:24,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-10-24 11:49:24,642 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:24,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:24,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1969097206, now seen corresponding path program 1 times [2024-10-24 11:49:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:24,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532278487] [2024-10-24 11:49:24,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:24,643 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-10-24 11:49:24,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:24,644 INFO L229 MonitoredProcess]: Starting monitored process 21 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-10-24 11:49:24,645 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 (21)] Waiting until timeout for monitored process [2024-10-24 11:49:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:24,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:49:24,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:24,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:49:24,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2024-10-24 11:49:24,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:24,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2024-10-24 11:49:25,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:25,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 44 [2024-10-24 11:49:25,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:25,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 26 [2024-10-24 11:49:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:49:25,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:25,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:25,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532278487] [2024-10-24 11:49:25,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532278487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:25,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:25,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:49:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395009699] [2024-10-24 11:49:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:25,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:49:25,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:25,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:49:25,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:49:25,128 INFO L87 Difference]: Start difference. First operand 200 states and 233 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:26,483 INFO L93 Difference]: Finished difference Result 612 states and 717 transitions. [2024-10-24 11:49:26,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:49:26,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-24 11:49:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:26,485 INFO L225 Difference]: With dead ends: 612 [2024-10-24 11:49:26,485 INFO L226 Difference]: Without dead ends: 413 [2024-10-24 11:49:26,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:49:26,486 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 268 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:26,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1055 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 11:49:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-24 11:49:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 200. [2024-10-24 11:49:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 169 states have (on average 1.1420118343195267) internal successors, (193), 169 states have internal predecessors, (193), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2024-10-24 11:49:26,519 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 233 transitions. Word has length 102 [2024-10-24 11:49:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:26,519 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 233 transitions. [2024-10-24 11:49:26,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 233 transitions. [2024-10-24 11:49:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:49:26,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:26,520 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:26,526 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 (21)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:26,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-10-24 11:49:26,721 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:26,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:26,721 INFO L85 PathProgramCache]: Analyzing trace with hash -762328332, now seen corresponding path program 1 times [2024-10-24 11:49:26,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:26,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764286323] [2024-10-24 11:49:26,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:26,722 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-10-24 11:49:26,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:26,723 INFO L229 MonitoredProcess]: Starting monitored process 22 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-10-24 11:49:26,724 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 (22)] Waiting until timeout for monitored process [2024-10-24 11:49:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:26,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 11:49:26,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:26,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:49:26,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:49:26,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-24 11:49:27,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:27,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-10-24 11:49:27,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:27,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-24 11:49:27,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2024-10-24 11:49:27,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 88 [2024-10-24 11:49:27,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:27,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 126 treesize of output 108 [2024-10-24 11:49:27,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:27,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 152 treesize of output 112 [2024-10-24 11:49:27,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:27,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 152 treesize of output 112 [2024-10-24 11:49:28,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:28,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 160 treesize of output 58 [2024-10-24 11:49:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-24 11:49:28,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:28,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:28,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764286323] [2024-10-24 11:49:28,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764286323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:28,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:28,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:49:28,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378996454] [2024-10-24 11:49:28,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:28,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:49:28,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:28,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:49:28,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:49:28,177 INFO L87 Difference]: Start difference. First operand 200 states and 233 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 11:49:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:30,873 INFO L93 Difference]: Finished difference Result 450 states and 531 transitions. [2024-10-24 11:49:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:49:30,874 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2024-10-24 11:49:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:30,875 INFO L225 Difference]: With dead ends: 450 [2024-10-24 11:49:30,875 INFO L226 Difference]: Without dead ends: 251 [2024-10-24 11:49:30,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:49:30,875 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 324 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:30,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 534 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 11:49:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-24 11:49:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 178. [2024-10-24 11:49:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 147 states have (on average 1.129251700680272) internal successors, (166), 147 states have internal predecessors, (166), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2024-10-24 11:49:30,904 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 102 [2024-10-24 11:49:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:30,905 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2024-10-24 11:49:30,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 11:49:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2024-10-24 11:49:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:49:30,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:30,905 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:30,912 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 (22)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:31,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-10-24 11:49:31,106 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:31,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:31,106 INFO L85 PathProgramCache]: Analyzing trace with hash 462998076, now seen corresponding path program 1 times [2024-10-24 11:49:31,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:31,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134612940] [2024-10-24 11:49:31,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:31,107 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-10-24 11:49:31,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:31,108 INFO L229 MonitoredProcess]: Starting monitored process 23 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-10-24 11:49:31,109 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 (23)] Waiting until timeout for monitored process [2024-10-24 11:49:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:31,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 11:49:31,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:31,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:49:31,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-24 11:49:31,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:31,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-24 11:49:31,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:31,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-24 11:49:31,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:31,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2024-10-24 11:49:31,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:31,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 55 [2024-10-24 11:49:31,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:31,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 55 [2024-10-24 11:49:31,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:31,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 75 [2024-10-24 11:49:31,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 76 [2024-10-24 11:49:31,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:49:31,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:31,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 152 [2024-10-24 11:49:31,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2024-10-24 11:49:32,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:32,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 169 treesize of output 73 [2024-10-24 11:49:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-24 11:49:32,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 11:49:32,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:32,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134612940] [2024-10-24 11:49:32,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134612940] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:49:32,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:49:32,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2024-10-24 11:49:32,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653797332] [2024-10-24 11:49:32,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:49:32,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:49:32,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:32,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:49:32,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:49:32,756 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand has 14 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 5 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2024-10-24 11:49:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:33,665 INFO L93 Difference]: Finished difference Result 437 states and 507 transitions. [2024-10-24 11:49:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 11:49:33,666 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 5 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 106 [2024-10-24 11:49:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:33,667 INFO L225 Difference]: With dead ends: 437 [2024-10-24 11:49:33,667 INFO L226 Difference]: Without dead ends: 260 [2024-10-24 11:49:33,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:49:33,668 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 219 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:33,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 233 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:49:33,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-24 11:49:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 178. [2024-10-24 11:49:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 147 states have (on average 1.1224489795918366) internal successors, (165), 147 states have internal predecessors, (165), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:33,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2024-10-24 11:49:33,706 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 106 [2024-10-24 11:49:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:33,707 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2024-10-24 11:49:33,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 5 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2024-10-24 11:49:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2024-10-24 11:49:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:49:33,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:33,709 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:33,719 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 (23)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:33,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-10-24 11:49:33,910 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:33,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1859402339, now seen corresponding path program 1 times [2024-10-24 11:49:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:33,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761162125] [2024-10-24 11:49:33,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:33,911 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-10-24 11:49:33,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:33,912 INFO L229 MonitoredProcess]: Starting monitored process 24 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-10-24 11:49:33,912 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 (24)] Waiting until timeout for monitored process [2024-10-24 11:49:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:34,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:49:34,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:34,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:49:34,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:49:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:49:34,141 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:34,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:34,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761162125] [2024-10-24 11:49:34,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761162125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:34,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:34,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:49:34,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398997532] [2024-10-24 11:49:34,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:34,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:49:34,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:34,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:49:34,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:49:34,143 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:34,642 INFO L93 Difference]: Finished difference Result 544 states and 626 transitions. [2024-10-24 11:49:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:49:34,642 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-24 11:49:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:34,644 INFO L225 Difference]: With dead ends: 544 [2024-10-24 11:49:34,644 INFO L226 Difference]: Without dead ends: 367 [2024-10-24 11:49:34,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:49:34,645 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 91 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:34,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 864 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:49:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-24 11:49:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 209. [2024-10-24 11:49:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 178 states have (on average 1.1123595505617978) internal successors, (198), 178 states have internal predecessors, (198), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 238 transitions. [2024-10-24 11:49:34,686 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 238 transitions. Word has length 106 [2024-10-24 11:49:34,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:34,686 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 238 transitions. [2024-10-24 11:49:34,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 238 transitions. [2024-10-24 11:49:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:49:34,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:34,687 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:34,694 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 (24)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:34,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-10-24 11:49:34,888 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:34,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1626218331, now seen corresponding path program 1 times [2024-10-24 11:49:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:34,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052171488] [2024-10-24 11:49:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:34,889 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-10-24 11:49:34,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:34,890 INFO L229 MonitoredProcess]: Starting monitored process 25 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-10-24 11:49:34,891 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 (25)] Waiting until timeout for monitored process [2024-10-24 11:49:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:35,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 11:49:35,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:35,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:49:35,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-24 11:49:35,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:35,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 57 [2024-10-24 11:49:35,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:35,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 55 [2024-10-24 11:49:35,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:35,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 55 [2024-10-24 11:49:35,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:35,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 66 [2024-10-24 11:49:35,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:35,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 80 [2024-10-24 11:49:36,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:36,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 48 [2024-10-24 11:49:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 3 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-24 11:49:36,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-10-24 11:49:37,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:37,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052171488] [2024-10-24 11:49:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052171488] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:49:37,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:49:37,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 36 [2024-10-24 11:49:37,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304339258] [2024-10-24 11:49:37,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:49:37,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-24 11:49:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:37,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-24 11:49:37,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1047, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 11:49:37,042 INFO L87 Difference]: Start difference. First operand 209 states and 238 transitions. Second operand has 36 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 7 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-24 11:49:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:39,379 INFO L93 Difference]: Finished difference Result 524 states and 591 transitions. [2024-10-24 11:49:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-24 11:49:39,380 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 7 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 106 [2024-10-24 11:49:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:39,381 INFO L225 Difference]: With dead ends: 524 [2024-10-24 11:49:39,381 INFO L226 Difference]: Without dead ends: 316 [2024-10-24 11:49:39,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=508, Invalid=2144, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 11:49:39,383 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 514 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:39,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 597 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 11:49:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-24 11:49:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 205. [2024-10-24 11:49:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 173 states have (on average 1.092485549132948) internal successors, (189), 173 states have internal predecessors, (189), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 229 transitions. [2024-10-24 11:49:39,423 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 229 transitions. Word has length 106 [2024-10-24 11:49:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:39,424 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 229 transitions. [2024-10-24 11:49:39,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 7 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-24 11:49:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 229 transitions. [2024-10-24 11:49:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:49:39,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:39,424 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:39,432 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 (25)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:39,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-10-24 11:49:39,625 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:39,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:39,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2117151216, now seen corresponding path program 1 times [2024-10-24 11:49:39,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:39,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868877346] [2024-10-24 11:49:39,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:39,626 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-10-24 11:49:39,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:39,627 INFO L229 MonitoredProcess]: Starting monitored process 26 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-10-24 11:49:39,628 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 (26)] Waiting until timeout for monitored process [2024-10-24 11:49:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:39,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:49:39,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:39,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:39,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 39 [2024-10-24 11:49:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:49:39,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:39,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:39,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868877346] [2024-10-24 11:49:39,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868877346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:39,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:39,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:49:39,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359248761] [2024-10-24 11:49:39,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:39,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:49:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:39,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:49:39,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:49:39,963 INFO L87 Difference]: Start difference. First operand 205 states and 229 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:40,343 INFO L93 Difference]: Finished difference Result 410 states and 458 transitions. [2024-10-24 11:49:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:49:40,344 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-24 11:49:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:40,345 INFO L225 Difference]: With dead ends: 410 [2024-10-24 11:49:40,345 INFO L226 Difference]: Without dead ends: 206 [2024-10-24 11:49:40,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:49:40,346 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 30 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:40,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 448 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:49:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-24 11:49:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2024-10-24 11:49:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 173 states have (on average 1.0809248554913296) internal successors, (187), 173 states have internal predecessors, (187), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 227 transitions. [2024-10-24 11:49:40,388 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 227 transitions. Word has length 106 [2024-10-24 11:49:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:40,389 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 227 transitions. [2024-10-24 11:49:40,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 227 transitions. [2024-10-24 11:49:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:49:40,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:40,389 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:40,399 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 (26)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:40,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-10-24 11:49:40,590 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:40,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:40,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1368469454, now seen corresponding path program 1 times [2024-10-24 11:49:40,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:40,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205092040] [2024-10-24 11:49:40,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:40,592 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-10-24 11:49:40,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:40,595 INFO L229 MonitoredProcess]: Starting monitored process 27 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-10-24 11:49:40,596 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 (27)] Waiting until timeout for monitored process [2024-10-24 11:49:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:40,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 11:49:40,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:40,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:49:40,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 11:49:40,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:40,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2024-10-24 11:49:40,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:40,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 42 [2024-10-24 11:49:40,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:40,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 42 [2024-10-24 11:49:40,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:40,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 62 [2024-10-24 11:49:41,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:41,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 75 [2024-10-24 11:49:41,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:41,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 43 [2024-10-24 11:49:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-24 11:49:41,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:49:41,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:41,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205092040] [2024-10-24 11:49:41,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205092040] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:49:41,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:49:41,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2024-10-24 11:49:41,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571740342] [2024-10-24 11:49:41,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:41,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:49:41,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:41,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:49:41,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:49:41,702 INFO L87 Difference]: Start difference. First operand 205 states and 227 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:42,327 INFO L93 Difference]: Finished difference Result 490 states and 546 transitions. [2024-10-24 11:49:42,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:49:42,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-24 11:49:42,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:42,329 INFO L225 Difference]: With dead ends: 490 [2024-10-24 11:49:42,329 INFO L226 Difference]: Without dead ends: 286 [2024-10-24 11:49:42,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-10-24 11:49:42,330 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 60 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:42,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 889 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:49:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-24 11:49:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 181. [2024-10-24 11:49:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 149 states have (on average 1.087248322147651) internal successors, (162), 149 states have internal predecessors, (162), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 202 transitions. [2024-10-24 11:49:42,369 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 202 transitions. Word has length 106 [2024-10-24 11:49:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:42,370 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 202 transitions. [2024-10-24 11:49:42,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 202 transitions. [2024-10-24 11:49:42,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:49:42,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:42,370 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:42,377 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 (27)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:42,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-10-24 11:49:42,571 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:42,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1727585384, now seen corresponding path program 1 times [2024-10-24 11:49:42,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:42,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79448245] [2024-10-24 11:49:42,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:42,572 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-10-24 11:49:42,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:42,573 INFO L229 MonitoredProcess]: Starting monitored process 28 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-10-24 11:49:42,574 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 (28)] Waiting until timeout for monitored process [2024-10-24 11:49:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:42,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:49:42,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:42,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:49:42,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:49:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:49:42,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:42,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:42,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79448245] [2024-10-24 11:49:42,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79448245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:42,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:42,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:49:42,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754154364] [2024-10-24 11:49:42,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:42,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:49:42,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:42,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:49:42,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:49:42,808 INFO L87 Difference]: Start difference. First operand 181 states and 202 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:43,373 INFO L93 Difference]: Finished difference Result 546 states and 610 transitions. [2024-10-24 11:49:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:49:43,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-10-24 11:49:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:43,375 INFO L225 Difference]: With dead ends: 546 [2024-10-24 11:49:43,375 INFO L226 Difference]: Without dead ends: 366 [2024-10-24 11:49:43,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:49:43,376 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 87 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:43,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1041 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:49:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-24 11:49:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 207. [2024-10-24 11:49:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.0857142857142856) internal successors, (190), 175 states have internal predecessors, (190), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2024-10-24 11:49:43,414 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 108 [2024-10-24 11:49:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:43,414 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2024-10-24 11:49:43,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2024-10-24 11:49:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:49:43,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:43,415 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:43,421 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 (28)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:43,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-10-24 11:49:43,616 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:43,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1155949541, now seen corresponding path program 1 times [2024-10-24 11:49:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:43,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43087575] [2024-10-24 11:49:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:43,616 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-10-24 11:49:43,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:43,617 INFO L229 MonitoredProcess]: Starting monitored process 29 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-10-24 11:49:43,618 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 (29)] Waiting until timeout for monitored process [2024-10-24 11:49:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:43,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 11:49:43,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:43,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:49:43,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-24 11:49:43,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:43,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2024-10-24 11:49:43,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:43,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 56 [2024-10-24 11:49:43,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:43,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 56 [2024-10-24 11:49:43,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:43,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 67 [2024-10-24 11:49:44,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:44,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 80 [2024-10-24 11:49:44,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:44,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 48 [2024-10-24 11:49:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 3 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-24 11:49:44,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:49:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-10-24 11:49:45,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:45,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43087575] [2024-10-24 11:49:45,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43087575] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:49:45,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:49:45,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2024-10-24 11:49:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849173888] [2024-10-24 11:49:45,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:49:45,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-24 11:49:45,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:45,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-24 11:49:45,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 11:49:45,293 INFO L87 Difference]: Start difference. First operand 207 states and 230 transitions. Second operand has 35 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 34 states have internal predecessors, (105), 7 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-24 11:49:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:48,489 INFO L93 Difference]: Finished difference Result 586 states and 648 transitions. [2024-10-24 11:49:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-24 11:49:48,490 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 34 states have internal predecessors, (105), 7 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 108 [2024-10-24 11:49:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:48,491 INFO L225 Difference]: With dead ends: 586 [2024-10-24 11:49:48,491 INFO L226 Difference]: Without dead ends: 380 [2024-10-24 11:49:48,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=657, Invalid=3375, Unknown=0, NotChecked=0, Total=4032 [2024-10-24 11:49:48,492 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 196 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:48,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1064 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 11:49:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-24 11:49:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 207. [2024-10-24 11:49:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.08) internal successors, (189), 175 states have internal predecessors, (189), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 229 transitions. [2024-10-24 11:49:48,532 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 229 transitions. Word has length 108 [2024-10-24 11:49:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:48,532 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 229 transitions. [2024-10-24 11:49:48,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 34 states have internal predecessors, (105), 7 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-24 11:49:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 229 transitions. [2024-10-24 11:49:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 11:49:48,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:48,533 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:48,540 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 (29)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:48,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-10-24 11:49:48,734 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:48,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1835394609, now seen corresponding path program 1 times [2024-10-24 11:49:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:48,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327181490] [2024-10-24 11:49:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:48,735 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-10-24 11:49:48,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:48,736 INFO L229 MonitoredProcess]: Starting monitored process 30 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-10-24 11:49:48,737 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 (30)] Waiting until timeout for monitored process [2024-10-24 11:49:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:48,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:49:48,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:48,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:49:49,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:49,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2024-10-24 11:49:49,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:49,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 46 [2024-10-24 11:49:49,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:49,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 46 [2024-10-24 11:49:49,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:49,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 57 [2024-10-24 11:49:49,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2024-10-24 11:49:49,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:49:49,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:49,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 120 [2024-10-24 11:49:49,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2024-10-24 11:49:49,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:49,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 149 treesize of output 77 [2024-10-24 11:49:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-24 11:49:49,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:49,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:49,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327181490] [2024-10-24 11:49:49,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327181490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:49,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:49,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:49:49,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889775889] [2024-10-24 11:49:49,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:49,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:49:49,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:49,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:49:49,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:49:49,758 INFO L87 Difference]: Start difference. First operand 207 states and 229 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 11:49:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:50,593 INFO L93 Difference]: Finished difference Result 425 states and 467 transitions. [2024-10-24 11:49:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 11:49:50,594 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 110 [2024-10-24 11:49:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:50,595 INFO L225 Difference]: With dead ends: 425 [2024-10-24 11:49:50,595 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 11:49:50,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:49:50,596 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 119 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:50,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 158 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:49:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 11:49:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 176. [2024-10-24 11:49:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 144 states have (on average 1.0694444444444444) internal successors, (154), 144 states have internal predecessors, (154), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 194 transitions. [2024-10-24 11:49:50,636 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 194 transitions. Word has length 110 [2024-10-24 11:49:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:50,636 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 194 transitions. [2024-10-24 11:49:50,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 11:49:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 194 transitions. [2024-10-24 11:49:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 11:49:50,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:50,637 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:50,645 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 (30)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:50,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-10-24 11:49:50,838 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:50,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash 180885143, now seen corresponding path program 1 times [2024-10-24 11:49:50,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:50,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230443984] [2024-10-24 11:49:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:50,838 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-10-24 11:49:50,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:50,839 INFO L229 MonitoredProcess]: Starting monitored process 31 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-10-24 11:49:50,840 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 (31)] Waiting until timeout for monitored process [2024-10-24 11:49:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:51,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:49:51,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:51,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:51,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 34 [2024-10-24 11:49:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:49:51,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:51,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:51,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230443984] [2024-10-24 11:49:51,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230443984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:51,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:51,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:49:51,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836030067] [2024-10-24 11:49:51,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:51,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:49:51,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:51,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:49:51,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:49:51,176 INFO L87 Difference]: Start difference. First operand 176 states and 194 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:49:51,657 INFO L93 Difference]: Finished difference Result 382 states and 422 transitions. [2024-10-24 11:49:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:49:51,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2024-10-24 11:49:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:49:51,659 INFO L225 Difference]: With dead ends: 382 [2024-10-24 11:49:51,659 INFO L226 Difference]: Without dead ends: 207 [2024-10-24 11:49:51,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:49:51,660 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 25 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:49:51,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 385 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:49:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-24 11:49:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 190. [2024-10-24 11:49:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 158 states have (on average 1.0696202531645569) internal successors, (169), 158 states have internal predecessors, (169), 20 states have call successors, (20), 11 states have call predecessors, (20), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:49:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2024-10-24 11:49:51,699 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 110 [2024-10-24 11:49:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:49:51,699 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2024-10-24 11:49:51,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:49:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2024-10-24 11:49:51,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 11:49:51,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:49:51,700 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:49:51,706 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 (31)] Forceful destruction successful, exit code 0 [2024-10-24 11:49:51,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-10-24 11:49:51,901 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:49:51,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:49:51,901 INFO L85 PathProgramCache]: Analyzing trace with hash 517312558, now seen corresponding path program 1 times [2024-10-24 11:49:51,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:49:51,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852719409] [2024-10-24 11:49:51,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:49:51,902 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-10-24 11:49:51,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:49:51,903 INFO L229 MonitoredProcess]: Starting monitored process 32 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-10-24 11:49:51,903 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 (32)] Waiting until timeout for monitored process [2024-10-24 11:49:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:49:52,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 11:49:52,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:49:52,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:49:52,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:52,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2024-10-24 11:49:52,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:52,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2024-10-24 11:49:52,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:52,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 41 [2024-10-24 11:49:52,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:52,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 52 [2024-10-24 11:49:52,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 67 [2024-10-24 11:49:52,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:49:52,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:52,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 119 [2024-10-24 11:49:52,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:49:52,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:49:52,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2024-10-24 11:49:53,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:49:53,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 170 treesize of output 86 [2024-10-24 11:49:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-24 11:49:53,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:49:53,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:49:53,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852719409] [2024-10-24 11:49:53,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852719409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:49:53,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:49:53,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:49:53,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286011981] [2024-10-24 11:49:53,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:49:53,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:49:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:49:53,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:49:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:49:53,289 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)