./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-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-47.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 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:56:49,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:56:49,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:56:49,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:56:49,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:56:49,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:56:49,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:56:49,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:56:49,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:56:49,491 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:56:49,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:56:49,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:56:49,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:56:49,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:56:49,494 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:56:49,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:56:49,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:56:49,495 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:56:49,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:56:49,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:56:49,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:56:49,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:56:49,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:56:49,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:56:49,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:56:49,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:56:49,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:56:49,501 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:56:49,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:56:49,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:56:49,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:56:49,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:56:49,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:56:49,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:56:49,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:56:49,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:56:49,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:56:49,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:56:49,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:56:49,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:56:49,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:56:49,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:56:49,504 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 -> 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 [2024-10-14 13:56:49,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:56:49,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:56:49,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:56:49,739 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:56:49,743 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:56:49,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2024-10-14 13:56:51,369 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:56:51,516 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:56:51,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2024-10-14 13:56:51,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b729adbfd/4d4ac9f157084dac961a9b83d4acfdae/FLAG6af443e32 [2024-10-14 13:56:51,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b729adbfd/4d4ac9f157084dac961a9b83d4acfdae [2024-10-14 13:56:51,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:56:51,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:56:51,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:56:51,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:56:51,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:56:51,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc32447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51, skipping insertion in model container [2024-10-14 13:56:51,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:56:51,672 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-47.i[916,929] [2024-10-14 13:56:51,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:56:51,734 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:56:51,742 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-47.i[916,929] [2024-10-14 13:56:51,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:56:51,790 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:56:51,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51 WrapperNode [2024-10-14 13:56:51,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:56:51,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:56:51,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:56:51,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:56:51,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,837 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2024-10-14 13:56:51,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:56:51,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:56:51,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:56:51,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:56:51,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,862 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 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-10-14 13:56:51,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:56:51,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:56:51,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:56:51,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:56:51,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (1/1) ... [2024-10-14 13:56:51,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:56:51,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:56:51,996 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-14 13:56:51,998 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-14 13:56:52,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:56:52,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:56:52,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:56:52,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:56:52,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:56:52,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:56:52,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:56:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:56:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:56:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:56:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:56:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:56:52,033 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:56:52,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:56:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:56:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:56:52,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:56:52,140 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:56:52,141 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:56:52,462 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-10-14 13:56:52,463 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:56:52,484 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:56:52,484 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:56:52,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:56:52 BoogieIcfgContainer [2024-10-14 13:56:52,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:56:52,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:56:52,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:56:52,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:56:52,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:56:51" (1/3) ... [2024-10-14 13:56:52,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae8fbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:56:52, skipping insertion in model container [2024-10-14 13:56:52,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:51" (2/3) ... [2024-10-14 13:56:52,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae8fbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:56:52, skipping insertion in model container [2024-10-14 13:56:52,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:56:52" (3/3) ... [2024-10-14 13:56:52,494 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-47.i [2024-10-14 13:56:52,508 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:56:52,508 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:56:52,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:56:52,563 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;@380c793e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:56:52,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:56:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 78 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:56:52,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 13:56:52,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:56:52,573 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:56:52,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:56:52,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:56:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1467365147, now seen corresponding path program 1 times [2024-10-14 13:56:52,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:56:52,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294597353] [2024-10-14 13:56:52,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:56:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:56:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:52,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:56:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:52,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 13:56:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:56:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:52,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:56:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:52,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:56:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:56:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:52,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:56:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:52,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:56:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:52,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:56:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:56:52,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:56:52,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294597353] [2024-10-14 13:56:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294597353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:56:52,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:56:52,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:56:52,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670915602] [2024-10-14 13:56:52,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:56:52,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:56:52,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:56:52,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:56:52,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:56:52,775 INFO L87 Difference]: Start difference. First operand has 89 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 78 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 13:56:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:56:52,801 INFO L93 Difference]: Finished difference Result 175 states and 275 transitions. [2024-10-14 13:56:52,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:56:52,804 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2024-10-14 13:56:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:56:52,810 INFO L225 Difference]: With dead ends: 175 [2024-10-14 13:56:52,810 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 13:56:52,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-14 13:56:52,817 INFO L432 NwaCegarLoop]: 125 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, 125 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-14 13:56:52,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:56:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 13:56:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-14 13:56:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:56:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-10-14 13:56:52,858 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 79 [2024-10-14 13:56:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:56:52,858 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-10-14 13:56:52,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 13:56:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-10-14 13:56:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 13:56:52,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:56:52,862 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:56:52,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:56:52,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:56:52,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:56:52,866 INFO L85 PathProgramCache]: Analyzing trace with hash 636971667, now seen corresponding path program 1 times [2024-10-14 13:56:52,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:56:52,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292122423] [2024-10-14 13:56:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:56:52,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:56:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:56:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 13:56:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:56:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:56:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:56:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:56:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:56:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:56:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:56:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:56:53,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:56:53,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292122423] [2024-10-14 13:56:53,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292122423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:56:53,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:56:53,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 13:56:53,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346279296] [2024-10-14 13:56:53,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:56:53,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 13:56:53,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:56:53,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 13:56:53,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 13:56:53,121 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:56:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:56:53,164 INFO L93 Difference]: Finished difference Result 174 states and 259 transitions. [2024-10-14 13:56:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 13:56:53,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2024-10-14 13:56:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:56:53,167 INFO L225 Difference]: With dead ends: 174 [2024-10-14 13:56:53,168 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 13:56:53,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-14 13:56:53,170 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:56:53,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:56:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 13:56:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 13:56:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:56:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-14 13:56:53,184 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 79 [2024-10-14 13:56:53,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:56:53,185 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-14 13:56:53,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:56:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-14 13:56:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 13:56:53,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:56:53,188 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:56:53,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:56:53,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:56:53,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:56:53,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1357173039, now seen corresponding path program 1 times [2024-10-14 13:56:53,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:56:53,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421726549] [2024-10-14 13:56:53,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:56:53,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:56:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:56:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 13:56:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:56:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:56:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:56:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:56:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:56:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:56:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:56:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:56:53,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:56:53,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421726549] [2024-10-14 13:56:53,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421726549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:56:53,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:56:53,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:56:53,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901808857] [2024-10-14 13:56:53,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:56:53,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:56:53,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:56:53,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:56:53,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:56:53,480 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:56:53,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:56:53,531 INFO L93 Difference]: Finished difference Result 178 states and 263 transitions. [2024-10-14 13:56:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:56:53,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2024-10-14 13:56:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:56:53,533 INFO L225 Difference]: With dead ends: 178 [2024-10-14 13:56:53,533 INFO L226 Difference]: Without dead ends: 91 [2024-10-14 13:56:53,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:56:53,534 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:56:53,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:56:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-14 13:56:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-14 13:56:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:56:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-14 13:56:53,545 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 79 [2024-10-14 13:56:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:56:53,547 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-14 13:56:53,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:56:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-14 13:56:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 13:56:53,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:56:53,549 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:56:53,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:56:53,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:56:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:56:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -754228705, now seen corresponding path program 1 times [2024-10-14 13:56:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:56:53,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000881198] [2024-10-14 13:56:53,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:56:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:56:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 13:56:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 13:56:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 13:56:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:56:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:56:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:56:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 13:56:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:56:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 13:56:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:56:53,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:56:53,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000881198] [2024-10-14 13:56:53,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000881198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:56:53,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:56:53,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:56:53,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469612099] [2024-10-14 13:56:53,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:56:53,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:56:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:56:53,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:56:53,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:56:53,717 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:56:53,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:56:53,756 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2024-10-14 13:56:53,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:56:53,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2024-10-14 13:56:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:56:53,758 INFO L225 Difference]: With dead ends: 184 [2024-10-14 13:56:53,758 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 13:56:53,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-14 13:56:53,759 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:56:53,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 362 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:56:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 13:56:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-10-14 13:56:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:56:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-10-14 13:56:53,773 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 79 [2024-10-14 13:56:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:56:53,774 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-10-14 13:56:53,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:56:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-10-14 13:56:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 13:56:53,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:56:53,775 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:56:53,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:56:53,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:56:53,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:56:53,776 INFO L85 PathProgramCache]: Analyzing trace with hash -754169123, now seen corresponding path program 1 times [2024-10-14 13:56:53,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:56:53,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561762503] [2024-10-14 13:56:53,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:56:53,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:56:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:56:53,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:56:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:56:53,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:56:53,914 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:56:53,915 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:56:53,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:56:53,920 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 13:56:53,962 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:56:53,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:56:53 BoogieIcfgContainer [2024-10-14 13:56:53,965 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:56:53,965 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:56:53,966 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:56:53,966 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:56:53,966 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:56:52" (3/4) ... [2024-10-14 13:56:53,968 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:56:53,968 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:56:53,969 INFO L158 Benchmark]: Toolchain (without parser) took 2429.66ms. Allocated memory is still 197.1MB. Free memory was 123.8MB in the beginning and 70.2MB in the end (delta: 53.6MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2024-10-14 13:56:53,973 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:56:53,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.80ms. Allocated memory is still 197.1MB. Free memory was 123.6MB in the beginning and 108.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 13:56:53,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.74ms. Allocated memory is still 197.1MB. Free memory was 108.4MB in the beginning and 105.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 13:56:53,974 INFO L158 Benchmark]: Boogie Preprocessor took 63.48ms. Allocated memory is still 197.1MB. Free memory was 105.0MB in the beginning and 100.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:56:53,974 INFO L158 Benchmark]: RCFGBuilder took 557.26ms. Allocated memory is still 197.1MB. Free memory was 165.4MB in the beginning and 134.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-14 13:56:53,975 INFO L158 Benchmark]: TraceAbstraction took 1478.90ms. Allocated memory is still 197.1MB. Free memory was 133.0MB in the beginning and 70.2MB in the end (delta: 62.8MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2024-10-14 13:56:53,975 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 197.1MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:56:53,976 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.10ms. Allocated memory is still 197.1MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.80ms. Allocated memory is still 197.1MB. Free memory was 123.6MB in the beginning and 108.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.74ms. Allocated memory is still 197.1MB. Free memory was 108.4MB in the beginning and 105.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.48ms. Allocated memory is still 197.1MB. Free memory was 105.0MB in the beginning and 100.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 557.26ms. Allocated memory is still 197.1MB. Free memory was 165.4MB in the beginning and 134.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1478.90ms. Allocated memory is still 197.1MB. Free memory was 133.0MB in the beginning and 70.2MB in the end (delta: 62.8MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 197.1MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L45] signed long int last_1_WrapperStruct0_var_1_12 = 8; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] EXPR WrapperStruct0.var_1_12 [L92] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L102] RET updateLastVariables() [L103] CALL updateVariables() [L76] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L77] EXPR WrapperStruct0.var_1_8 [L77] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L77] EXPR WrapperStruct0.var_1_8 [L77] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L78] WrapperStruct0.var_1_10 = __VERIFIER_nondet_char() [L79] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L79] CALL assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L79] RET assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L80] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L80] CALL assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L80] RET assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L81] WrapperStruct0.var_1_11 = __VERIFIER_nondet_char() [L82] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L82] CALL assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L82] RET assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L83] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L83] CALL assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L83] RET assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L84] WrapperStruct0.var_1_13 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L85] CALL assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L85] RET assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] CALL assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] RET assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L87] WrapperStruct0.var_1_14 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] CALL assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] RET assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L103] RET updateVariables() [L104] CALL step() [L49] COND FALSE !(-4 > last_1_WrapperStruct0_var_1_12) [L54] EXPR WrapperStruct0.var_1_10 [L54] WrapperStruct0.var_1_9 = WrapperStruct0.var_1_10 [L56] EXPR WrapperStruct0.var_1_13 [L56] unsigned char stepLocal_0 = ! WrapperStruct0.var_1_13; [L57] stepLocal_0 || WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L57] stepLocal_0 || WrapperStruct0.var_1_14 [L57] EXPR WrapperStruct0.var_1_14 [L57] stepLocal_0 || WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L57] COND FALSE !(stepLocal_0 || WrapperStruct0.var_1_14) [L64] EXPR WrapperStruct0.var_1_8 [L64] WrapperStruct0.var_1_15 = WrapperStruct0.var_1_8 [L65] EXPR WrapperStruct0.var_1_15 [L65] EXPR WrapperStruct0.var_1_15 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L65] COND FALSE !(WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) [L70] EXPR WrapperStruct0.var_1_12 [L70] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L70] COND TRUE WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9 [L71] EXPR WrapperStruct0.var_1_8 [L71] WrapperStruct0.var_1_1 = WrapperStruct0.var_1_8 [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR WrapperStruct0.var_1_15 [L95] EXPR WrapperStruct0.var_1_15 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1) [L95] EXPR WrapperStruct0.var_1_12 [L95] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1 [L95] EXPR WrapperStruct0.var_1_1 [L95] EXPR WrapperStruct0.var_1_8 [L95] EXPR (WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1)) && (WrapperStruct0.var_1_15 == ((double) WrapperStruct0.var_1_8)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1)) && (WrapperStruct0.var_1_15 == ((double) WrapperStruct0.var_1_8)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95-L96] return ((((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1)) && (WrapperStruct0.var_1_15 == ((double) WrapperStruct0.var_1_8)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L19] reach_error() VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1209 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 715 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 494 mSDtfsCounter, 77 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=4, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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-14 13:56:54,004 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-47.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 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:56:56,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:56:56,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:56:56,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:56:56,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:56:56,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:56:56,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:56:56,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:56:56,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:56:56,135 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:56:56,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:56:56,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:56:56,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:56:56,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:56:56,136 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:56:56,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:56:56,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:56:56,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:56:56,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:56:56,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:56:56,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:56:56,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:56:56,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:56:56,143 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:56:56,143 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:56:56,143 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:56:56,144 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:56:56,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:56:56,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:56:56,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:56:56,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:56:56,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:56:56,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:56:56,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:56:56,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:56:56,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:56:56,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:56:56,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:56:56,145 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:56:56,145 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:56:56,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:56:56,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:56:56,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:56:56,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:56:56,146 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:56:56,147 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 -> 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 [2024-10-14 13:56:56,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:56:56,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:56:56,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:56:56,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:56:56,432 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:56:56,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2024-10-14 13:56:57,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:56:58,108 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:56:58,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2024-10-14 13:56:58,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05b599c9b/3d36f3b2f895435ea38f1a699099ab8e/FLAG73a9b8f79 [2024-10-14 13:56:58,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05b599c9b/3d36f3b2f895435ea38f1a699099ab8e [2024-10-14 13:56:58,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:56:58,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:56:58,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:56:58,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:56:58,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:56:58,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505f807f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58, skipping insertion in model container [2024-10-14 13:56:58,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:56:58,335 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-47.i[916,929] [2024-10-14 13:56:58,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:56:58,426 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:56:58,442 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-47.i[916,929] [2024-10-14 13:56:58,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:56:58,501 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:56:58,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58 WrapperNode [2024-10-14 13:56:58,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:56:58,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:56:58,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:56:58,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:56:58,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,549 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449 [2024-10-14 13:56:58,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:56:58,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:56:58,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:56:58,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:56:58,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,580 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 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-10-14 13:56:58,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:56:58,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:56:58,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:56:58,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:56:58,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (1/1) ... [2024-10-14 13:56:58,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:56:58,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:56:58,649 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-14 13:56:58,651 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-14 13:56:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:56:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-14 13:56:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-14 13:56:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-14 13:56:58,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-14 13:56:58,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 13:56:58,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 13:56:58,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:56:58,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 13:56:58,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 13:56:58,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 13:56:58,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-14 13:56:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-14 13:56:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 13:56:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 13:56:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:56:58,687 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:56:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:56:58,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:56:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 13:56:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 13:56:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 13:56:58,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 13:56:58,804 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:56:58,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:56:59,243 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-10-14 13:56:59,243 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:56:59,298 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:56:59,299 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:56:59,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:56:59 BoogieIcfgContainer [2024-10-14 13:56:59,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:56:59,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:56:59,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:56:59,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:56:59,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:56:58" (1/3) ... [2024-10-14 13:56:59,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159f629f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:56:59, skipping insertion in model container [2024-10-14 13:56:59,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:56:58" (2/3) ... [2024-10-14 13:56:59,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159f629f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:56:59, skipping insertion in model container [2024-10-14 13:56:59,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:56:59" (3/3) ... [2024-10-14 13:56:59,307 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-47.i [2024-10-14 13:56:59,319 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:56:59,319 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:56:59,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:56:59,372 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;@333294ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:56:59,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:56:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 78 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:56:59,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 13:56:59,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:56:59,383 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:56:59,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:56:59,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:56:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1467365147, now seen corresponding path program 1 times [2024-10-14 13:56:59,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:56:59,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920340167] [2024-10-14 13:56:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:56:59,399 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-14 13:56:59,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:56:59,402 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-14 13:56:59,403 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-14 13:56:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:56:59,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:56:59,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:56:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-14 13:56:59,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:56:59,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:56:59,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920340167] [2024-10-14 13:56:59,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920340167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:56:59,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:56:59,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:56:59,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542831825] [2024-10-14 13:56:59,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:56:59,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:56:59,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:56:59,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:56:59,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:56:59,644 INFO L87 Difference]: Start difference. First operand has 89 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 78 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 13:56:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:56:59,676 INFO L93 Difference]: Finished difference Result 175 states and 275 transitions. [2024-10-14 13:56:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:56:59,677 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2024-10-14 13:56:59,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:56:59,682 INFO L225 Difference]: With dead ends: 175 [2024-10-14 13:56:59,683 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 13:56:59,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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-14 13:56:59,687 INFO L432 NwaCegarLoop]: 125 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, 125 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-14 13:56:59,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:56:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 13:56:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-14 13:56:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:56:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-10-14 13:56:59,718 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 79 [2024-10-14 13:56:59,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:56:59,719 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-10-14 13:56:59,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 13:56:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-10-14 13:56:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 13:56:59,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:56:59,722 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:56:59,731 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-14 13:56:59,925 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-14 13:56:59,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:56:59,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:56:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash 636971667, now seen corresponding path program 1 times [2024-10-14 13:56:59,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:56:59,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121318062] [2024-10-14 13:56:59,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:56:59,931 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-14 13:56:59,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:56:59,933 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-14 13:56:59,934 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-14 13:57:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:00,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 13:57:00,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:57:00,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:57:00,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:00,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121318062] [2024-10-14 13:57:00,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121318062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:57:00,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:57:00,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 13:57:00,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254847316] [2024-10-14 13:57:00,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:00,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 13:57:00,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:00,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 13:57:00,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 13:57:00,131 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:57:00,163 INFO L93 Difference]: Finished difference Result 174 states and 259 transitions. [2024-10-14 13:57:00,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 13:57:00,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2024-10-14 13:57:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:57:00,165 INFO L225 Difference]: With dead ends: 174 [2024-10-14 13:57:00,169 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 13:57:00,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 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-14 13:57:00,170 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:57:00,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:57:00,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 13:57:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 13:57:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:57:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-14 13:57:00,178 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 79 [2024-10-14 13:57:00,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:57:00,179 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-14 13:57:00,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:00,179 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-14 13:57:00,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 13:57:00,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:57:00,181 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:57:00,188 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-14 13:57:00,384 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-14 13:57:00,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:57:00,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:57:00,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1357173039, now seen corresponding path program 1 times [2024-10-14 13:57:00,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:57:00,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598974541] [2024-10-14 13:57:00,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:00,387 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-14 13:57:00,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:57:00,389 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-14 13:57:00,392 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-14 13:57:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:00,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:57:00,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:57:00,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:57:00,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598974541] [2024-10-14 13:57:00,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598974541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:57:00,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:57:00,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:57:00,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156898373] [2024-10-14 13:57:00,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:00,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:57:00,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:00,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:57:00,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:57:00,590 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:57:00,655 INFO L93 Difference]: Finished difference Result 178 states and 263 transitions. [2024-10-14 13:57:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:57:00,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2024-10-14 13:57:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:57:00,658 INFO L225 Difference]: With dead ends: 178 [2024-10-14 13:57:00,658 INFO L226 Difference]: Without dead ends: 91 [2024-10-14 13:57:00,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:57:00,660 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:57:00,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:57:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-14 13:57:00,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-14 13:57:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:57:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-14 13:57:00,667 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 79 [2024-10-14 13:57:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:57:00,667 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-14 13:57:00,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-14 13:57:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 13:57:00,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:57:00,671 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:57:00,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 13:57:00,871 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-14 13:57:00,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:57:00,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:57:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash -754228705, now seen corresponding path program 1 times [2024-10-14 13:57:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:57:00,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348735535] [2024-10-14 13:57:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:00,873 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-14 13:57:00,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:57:00,877 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-14 13:57:00,882 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-14 13:57:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:01,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:57:01,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:57:01,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:57:01,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:01,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348735535] [2024-10-14 13:57:01,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348735535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:57:01,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:57:01,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:57:01,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650151928] [2024-10-14 13:57:01,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:01,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:57:01,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:01,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:57:01,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:57:01,067 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:57:01,118 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2024-10-14 13:57:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:57:01,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2024-10-14 13:57:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:57:01,120 INFO L225 Difference]: With dead ends: 186 [2024-10-14 13:57:01,120 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 13:57:01,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:57:01,121 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:57:01,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:57:01,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 13:57:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-14 13:57:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:57:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-10-14 13:57:01,147 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 79 [2024-10-14 13:57:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:57:01,148 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-10-14 13:57:01,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-10-14 13:57:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 13:57:01,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:57:01,149 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:57:01,155 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 (5)] Forceful destruction successful, exit code 0 [2024-10-14 13:57:01,353 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-14 13:57:01,353 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:57:01,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:57:01,354 INFO L85 PathProgramCache]: Analyzing trace with hash -754169123, now seen corresponding path program 1 times [2024-10-14 13:57:01,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:57:01,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107720929] [2024-10-14 13:57:01,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:01,355 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-14 13:57:01,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:57:01,357 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-14 13:57:01,358 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-14 13:57:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:01,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 13:57:01,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:01,730 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-14 13:57:01,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:01,997 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 127 treesize of output 69 [2024-10-14 13:57:02,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:02,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 142 treesize of output 72 [2024-10-14 13:57:02,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:02,640 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 137 treesize of output 82 [2024-10-14 13:57:02,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:02,968 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 152 treesize of output 85 [2024-10-14 13:57:03,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:03,207 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 154 treesize of output 96 [2024-10-14 13:57:03,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:03,433 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 207 treesize of output 75 [2024-10-14 13:57:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 13:57:03,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:57:03,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:03,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107720929] [2024-10-14 13:57:03,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107720929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:57:03,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:57:03,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 13:57:03,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133496784] [2024-10-14 13:57:03,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:03,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 13:57:03,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:03,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 13:57:03,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:57:03,534 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 13:57:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:57:05,747 INFO L93 Difference]: Finished difference Result 349 states and 497 transitions. [2024-10-14 13:57:05,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 13:57:05,748 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 79 [2024-10-14 13:57:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:57:05,750 INFO L225 Difference]: With dead ends: 349 [2024-10-14 13:57:05,750 INFO L226 Difference]: Without dead ends: 255 [2024-10-14 13:57:05,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2024-10-14 13:57:05,751 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 684 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 13:57:05,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 430 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 13:57:05,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-14 13:57:05,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 145. [2024-10-14 13:57:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 122 states have internal predecessors, (168), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:57:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 204 transitions. [2024-10-14 13:57:05,786 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 204 transitions. Word has length 79 [2024-10-14 13:57:05,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:57:05,787 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 204 transitions. [2024-10-14 13:57:05,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 13:57:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 204 transitions. [2024-10-14 13:57:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 13:57:05,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:57:05,788 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:57:05,801 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-14 13:57:05,988 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-14 13:57:05,989 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:57:05,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:57:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1140741972, now seen corresponding path program 1 times [2024-10-14 13:57:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:57:05,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307698158] [2024-10-14 13:57:05,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:05,990 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-14 13:57:05,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:57:05,992 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-14 13:57:05,993 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-14 13:57:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:06,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 13:57:06,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:06,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:06,247 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 154 treesize of output 46 [2024-10-14 13:57:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:57:06,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:57:06,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:06,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307698158] [2024-10-14 13:57:06,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307698158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:57:06,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:57:06,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:57:06,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210559247] [2024-10-14 13:57:06,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:06,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:57:06,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:06,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:57:06,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:57:06,326 INFO L87 Difference]: Start difference. First operand 145 states and 204 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:57:09,820 INFO L93 Difference]: Finished difference Result 425 states and 597 transitions. [2024-10-14 13:57:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:57:09,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2024-10-14 13:57:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:57:09,824 INFO L225 Difference]: With dead ends: 425 [2024-10-14 13:57:09,825 INFO L226 Difference]: Without dead ends: 281 [2024-10-14 13:57:09,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:57:09,826 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 108 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:57:09,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 234 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-14 13:57:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-14 13:57:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 147. [2024-10-14 13:57:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 124 states have (on average 1.3709677419354838) internal successors, (170), 124 states have internal predecessors, (170), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:57:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 206 transitions. [2024-10-14 13:57:09,863 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 206 transitions. Word has length 79 [2024-10-14 13:57:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:57:09,866 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 206 transitions. [2024-10-14 13:57:09,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 206 transitions. [2024-10-14 13:57:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 13:57:09,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:57:09,872 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:57:09,884 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-14 13:57:10,075 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-14 13:57:10,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:57:10,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:57:10,079 INFO L85 PathProgramCache]: Analyzing trace with hash -727103521, now seen corresponding path program 1 times [2024-10-14 13:57:10,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:57:10,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028664947] [2024-10-14 13:57:10,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:10,079 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-14 13:57:10,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:57:10,081 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-14 13:57:10,082 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-14 13:57:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:10,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:57:10,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:57:10,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:57:10,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:10,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028664947] [2024-10-14 13:57:10,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028664947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:57:10,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:57:10,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:57:10,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325576829] [2024-10-14 13:57:10,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:10,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:57:10,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:10,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:57:10,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:57:10,259 INFO L87 Difference]: Start difference. First operand 147 states and 206 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:57:10,311 INFO L93 Difference]: Finished difference Result 293 states and 411 transitions. [2024-10-14 13:57:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:57:10,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2024-10-14 13:57:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:57:10,313 INFO L225 Difference]: With dead ends: 293 [2024-10-14 13:57:10,313 INFO L226 Difference]: Without dead ends: 147 [2024-10-14 13:57:10,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 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-14 13:57:10,314 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:57:10,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:57:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-14 13:57:10,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-14 13:57:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 124 states have internal predecessors, (169), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:57:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 205 transitions. [2024-10-14 13:57:10,327 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 205 transitions. Word has length 79 [2024-10-14 13:57:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:57:10,327 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 205 transitions. [2024-10-14 13:57:10,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 205 transitions. [2024-10-14 13:57:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 13:57:10,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:57:10,329 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:57:10,338 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-14 13:57:10,529 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-14 13:57:10,530 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:57:10,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:57:10,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1423977953, now seen corresponding path program 1 times [2024-10-14 13:57:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:57:10,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28770820] [2024-10-14 13:57:10,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:10,531 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-14 13:57:10,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:57:10,532 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-14 13:57:10,534 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-14 13:57:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:10,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 13:57:10,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:10,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:10,743 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 66 treesize of output 24 [2024-10-14 13:57:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:57:10,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:57:10,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:10,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28770820] [2024-10-14 13:57:10,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28770820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:57:10,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:57:10,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:57:10,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021123088] [2024-10-14 13:57:10,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:10,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:57:10,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:10,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:57:10,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:57:10,775 INFO L87 Difference]: Start difference. First operand 147 states and 205 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:57:11,861 INFO L93 Difference]: Finished difference Result 434 states and 606 transitions. [2024-10-14 13:57:11,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:57:11,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 81 [2024-10-14 13:57:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:57:11,863 INFO L225 Difference]: With dead ends: 434 [2024-10-14 13:57:11,863 INFO L226 Difference]: Without dead ends: 288 [2024-10-14 13:57:11,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:57:11,864 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:57:11,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 298 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 13:57:11,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-14 13:57:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 264. [2024-10-14 13:57:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 219 states have (on average 1.3378995433789955) internal successors, (293), 219 states have internal predecessors, (293), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 13:57:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 365 transitions. [2024-10-14 13:57:11,915 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 365 transitions. Word has length 81 [2024-10-14 13:57:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:57:11,915 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 365 transitions. [2024-10-14 13:57:11,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 365 transitions. [2024-10-14 13:57:11,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 13:57:11,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:57:11,917 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:57:11,925 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-14 13:57:12,117 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-14 13:57:12,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:57:12,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:57:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash -124621637, now seen corresponding path program 1 times [2024-10-14 13:57:12,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:57:12,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494640359] [2024-10-14 13:57:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:12,120 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-14 13:57:12,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:57:12,122 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-14 13:57:12,123 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-14 13:57:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:12,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 13:57:12,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:12,367 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-14 13:57:12,575 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 52 treesize of output 24 [2024-10-14 13:57:12,671 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 47 treesize of output 34 [2024-10-14 13:57:12,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:12,816 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 62 treesize of output 37 [2024-10-14 13:57:12,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:12,961 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 64 treesize of output 48 [2024-10-14 13:57:13,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:13,076 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 80 treesize of output 71 [2024-10-14 13:57:17,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:17,189 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 128 treesize of output 56 [2024-10-14 13:57:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 13:57:17,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:57:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:57:17,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:17,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494640359] [2024-10-14 13:57:17,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494640359] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:57:17,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:57:17,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 19 [2024-10-14 13:57:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559800291] [2024-10-14 13:57:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:17,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:57:17,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:17,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:57:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=277, Unknown=1, NotChecked=0, Total=342 [2024-10-14 13:57:17,394 INFO L87 Difference]: Start difference. First operand 264 states and 365 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:57:18,037 INFO L93 Difference]: Finished difference Result 684 states and 942 transitions. [2024-10-14 13:57:18,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:57:18,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 81 [2024-10-14 13:57:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:57:18,046 INFO L225 Difference]: With dead ends: 684 [2024-10-14 13:57:18,047 INFO L226 Difference]: Without dead ends: 421 [2024-10-14 13:57:18,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=76, Invalid=385, Unknown=1, NotChecked=0, Total=462 [2024-10-14 13:57:18,048 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 82 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:57:18,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 369 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 13:57:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-14 13:57:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 405. [2024-10-14 13:57:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 356 states have (on average 1.3623595505617978) internal successors, (485), 358 states have internal predecessors, (485), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 13:57:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 561 transitions. [2024-10-14 13:57:18,102 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 561 transitions. Word has length 81 [2024-10-14 13:57:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:57:18,102 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 561 transitions. [2024-10-14 13:57:18,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 561 transitions. [2024-10-14 13:57:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 13:57:18,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:57:18,103 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:57:18,119 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 (10)] Ended with exit code 0 [2024-10-14 13:57:18,303 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-14 13:57:18,304 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:57:18,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:57:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash 916042595, now seen corresponding path program 1 times [2024-10-14 13:57:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:57:18,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636308444] [2024-10-14 13:57:18,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:18,305 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-14 13:57:18,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:57:18,309 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-14 13:57:18,312 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-14 13:57:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:18,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 13:57:18,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:18,524 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-14 13:57:18,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:18,843 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 130 treesize of output 57 [2024-10-14 13:57:18,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:18,967 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 125 treesize of output 67 [2024-10-14 13:57:19,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:19,183 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 135 treesize of output 80 [2024-10-14 13:57:19,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:19,438 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 150 treesize of output 83 [2024-10-14 13:57:19,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:19,673 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 152 treesize of output 103 [2024-10-14 13:57:19,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:19,823 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 205 treesize of output 73 [2024-10-14 13:57:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 88 proven. 24 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 13:57:21,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:57:21,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636308444] [2024-10-14 13:57:21,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636308444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:57:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1475335090] [2024-10-14 13:57:21,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:21,326 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 13:57:21,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 13:57:21,330 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 13:57:21,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-14 13:57:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:21,516 WARN L253 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-10-14 13:57:21,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:21,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-14 13:57:21,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 51 [2024-10-14 13:57:22,378 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 81 treesize of output 62 [2024-10-14 13:57:22,962 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 80 treesize of output 76 [2024-10-14 13:57:23,546 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 88 treesize of output 87 [2024-10-14 13:57:24,184 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 99 [2024-10-14 13:57:24,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 121 [2024-10-14 13:57:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 13:57:25,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:57:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1475335090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:57:25,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:57:25,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [13] total 32 [2024-10-14 13:57:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178555071] [2024-10-14 13:57:25,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:25,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 13:57:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:25,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 13:57:25,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 13:57:25,715 INFO L87 Difference]: Start difference. First operand 405 states and 561 transitions. Second operand has 21 states, 13 states have (on average 3.923076923076923) internal successors, (51), 20 states have internal predecessors, (51), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:57:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:57:32,138 INFO L93 Difference]: Finished difference Result 1234 states and 1679 transitions. [2024-10-14 13:57:32,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 13:57:32,139 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 13 states have (on average 3.923076923076923) internal successors, (51), 20 states have internal predecessors, (51), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 9 states have call successors, (9) Word has length 81 [2024-10-14 13:57:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:57:32,143 INFO L225 Difference]: With dead ends: 1234 [2024-10-14 13:57:32,143 INFO L226 Difference]: Without dead ends: 830 [2024-10-14 13:57:32,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=366, Invalid=2390, Unknown=0, NotChecked=0, Total=2756 [2024-10-14 13:57:32,144 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 874 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-14 13:57:32,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 818 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-14 13:57:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-10-14 13:57:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 502. [2024-10-14 13:57:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 421 states have (on average 1.3159144893111638) internal successors, (554), 423 states have internal predecessors, (554), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 13:57:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 666 transitions. [2024-10-14 13:57:32,204 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 666 transitions. Word has length 81 [2024-10-14 13:57:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:57:32,205 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 666 transitions. [2024-10-14 13:57:32,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 13 states have (on average 3.923076923076923) internal successors, (51), 20 states have internal predecessors, (51), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:57:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 666 transitions. [2024-10-14 13:57:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 13:57:32,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:57:32,207 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:57:32,216 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 (11)] Ended with exit code 0 [2024-10-14 13:57:32,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-10-14 13:57:32,611 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 13:57:32,612 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:57:32,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:57:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1156282341, now seen corresponding path program 1 times [2024-10-14 13:57:32,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:57:32,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790747652] [2024-10-14 13:57:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:32,614 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-14 13:57:32,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:57:32,617 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-14 13:57:32,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 (13)] Waiting until timeout for monitored process [2024-10-14 13:57:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:32,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 13:57:32,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:32,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:32,921 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 175 treesize of output 67 [2024-10-14 13:57:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:57:32,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:57:32,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:32,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790747652] [2024-10-14 13:57:32,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790747652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:57:32,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:57:32,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 13:57:32,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023625318] [2024-10-14 13:57:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:32,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:57:32,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:32,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:57:32,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:57:32,963 INFO L87 Difference]: Start difference. First operand 502 states and 666 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 13:57:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:57:33,771 INFO L93 Difference]: Finished difference Result 984 states and 1294 transitions. [2024-10-14 13:57:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 13:57:33,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2024-10-14 13:57:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:57:33,774 INFO L225 Difference]: With dead ends: 984 [2024-10-14 13:57:33,774 INFO L226 Difference]: Without dead ends: 443 [2024-10-14 13:57:33,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-10-14 13:57:33,775 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:57:33,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 610 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:57:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-14 13:57:33,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 369. [2024-10-14 13:57:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 312 states have (on average 1.3044871794871795) internal successors, (407), 312 states have internal predecessors, (407), 36 states have call successors, (36), 20 states have call predecessors, (36), 20 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 13:57:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 479 transitions. [2024-10-14 13:57:33,843 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 479 transitions. Word has length 81 [2024-10-14 13:57:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:57:33,844 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 479 transitions. [2024-10-14 13:57:33,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 13:57:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 479 transitions. [2024-10-14 13:57:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 13:57:33,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:57:33,845 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:57:33,856 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-14 13:57:34,045 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-14 13:57:34,045 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:57:34,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:57:34,046 INFO L85 PathProgramCache]: Analyzing trace with hash -695640564, now seen corresponding path program 1 times [2024-10-14 13:57:34,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:57:34,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924138912] [2024-10-14 13:57:34,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:34,046 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-14 13:57:34,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:57:34,053 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-14 13:57:34,054 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-14 13:57:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:34,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 13:57:34,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 13:57:34,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:57:34,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:34,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924138912] [2024-10-14 13:57:34,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924138912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:57:34,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:57:34,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 13:57:34,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659093116] [2024-10-14 13:57:34,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:34,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:57:34,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:34,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:57:34,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:57:34,346 INFO L87 Difference]: Start difference. First operand 369 states and 479 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:34,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:57:34,736 INFO L93 Difference]: Finished difference Result 1078 states and 1386 transitions. [2024-10-14 13:57:34,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:57:34,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 82 [2024-10-14 13:57:34,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:57:34,739 INFO L225 Difference]: With dead ends: 1078 [2024-10-14 13:57:34,739 INFO L226 Difference]: Without dead ends: 710 [2024-10-14 13:57:34,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:57:34,740 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 207 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:57:34,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 246 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 13:57:34,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-10-14 13:57:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 552. [2024-10-14 13:57:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 467 states have (on average 1.284796573875803) internal successors, (600), 467 states have internal predecessors, (600), 54 states have call successors, (54), 30 states have call predecessors, (54), 30 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 13:57:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 708 transitions. [2024-10-14 13:57:34,794 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 708 transitions. Word has length 82 [2024-10-14 13:57:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:57:34,795 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 708 transitions. [2024-10-14 13:57:34,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 13:57:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 708 transitions. [2024-10-14 13:57:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 13:57:34,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:57:34,796 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:57:34,807 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-14 13:57:34,997 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-14 13:57:34,997 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:57:34,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:57:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1955179214, now seen corresponding path program 1 times [2024-10-14 13:57:34,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:57:34,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689515093] [2024-10-14 13:57:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:34,998 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-14 13:57:34,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:57:34,999 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-14 13:57:35,008 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-14 13:57:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:35,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 13:57:35,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:35,267 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-14 13:57:35,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:35,507 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 130 treesize of output 57 [2024-10-14 13:57:35,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:35,597 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 130 treesize of output 57 [2024-10-14 13:57:35,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:35,689 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 125 treesize of output 67 [2024-10-14 13:57:35,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:35,847 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 135 treesize of output 80 [2024-10-14 13:57:36,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:36,068 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 152 treesize of output 103 [2024-10-14 13:57:36,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:36,231 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 167 treesize of output 106 [2024-10-14 13:57:36,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:36,479 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 205 treesize of output 73 [2024-10-14 13:57:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 88 proven. 24 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 13:57:36,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:57:36,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:36,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689515093] [2024-10-14 13:57:36,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689515093] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:57:36,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1915347893] [2024-10-14 13:57:36,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:36,742 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 13:57:36,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 13:57:36,744 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 13:57:36,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-10-14 13:57:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:36,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-10-14 13:57:36,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:36,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-14 13:57:37,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 51 [2024-10-14 13:57:37,723 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 81 treesize of output 62 [2024-10-14 13:57:38,203 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 80 treesize of output 76 [2024-10-14 13:57:38,824 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 88 treesize of output 87 [2024-10-14 13:57:39,513 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 99 [2024-10-14 13:57:39,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 112 [2024-10-14 13:57:40,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 45 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 132 [2024-10-14 13:57:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 13:57:41,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:57:41,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1915347893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:57:41,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:57:41,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [13] total 31 [2024-10-14 13:57:41,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124659859] [2024-10-14 13:57:41,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:41,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 13:57:41,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:41,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 13:57:41,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 13:57:41,183 INFO L87 Difference]: Start difference. First operand 552 states and 708 transitions. Second operand has 20 states, 12 states have (on average 4.333333333333333) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:57:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:57:47,369 INFO L93 Difference]: Finished difference Result 1109 states and 1441 transitions. [2024-10-14 13:57:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 13:57:47,370 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 12 states have (on average 4.333333333333333) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 9 states have call successors, (9) Word has length 82 [2024-10-14 13:57:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:57:47,373 INFO L225 Difference]: With dead ends: 1109 [2024-10-14 13:57:47,373 INFO L226 Difference]: Without dead ends: 726 [2024-10-14 13:57:47,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=378, Invalid=2172, Unknown=0, NotChecked=0, Total=2550 [2024-10-14 13:57:47,374 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 789 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-14 13:57:47,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 903 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-14 13:57:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-10-14 13:57:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 552. [2024-10-14 13:57:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 467 states have (on average 1.284796573875803) internal successors, (600), 467 states have internal predecessors, (600), 54 states have call successors, (54), 30 states have call predecessors, (54), 30 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 13:57:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 708 transitions. [2024-10-14 13:57:47,441 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 708 transitions. Word has length 82 [2024-10-14 13:57:47,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:57:47,441 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 708 transitions. [2024-10-14 13:57:47,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 12 states have (on average 4.333333333333333) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 13:57:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 708 transitions. [2024-10-14 13:57:47,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 13:57:47,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:57:47,443 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 13:57:47,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-10-14 13:57:47,656 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-14 13:57:47,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,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-14 13:57:47,848 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:57:47,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:57:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash -390385786, now seen corresponding path program 1 times [2024-10-14 13:57:47,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:57:47,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713911895] [2024-10-14 13:57:47,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:57:47,849 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-14 13:57:47,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:57:47,853 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-14 13:57:47,857 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-14 13:57:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:57:48,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-14 13:57:48,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:57:48,152 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-14 13:57:48,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:48,509 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 132 treesize of output 59 [2024-10-14 13:57:48,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:48,727 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 127 treesize of output 69 [2024-10-14 13:57:49,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57: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 137 treesize of output 82 [2024-10-14 13:57:49,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:49,406 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 152 treesize of output 85 [2024-10-14 13:57:49,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:49,678 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 154 treesize of output 105 [2024-10-14 13:57:49,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:49,865 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 175 treesize of output 118 [2024-10-14 13:57:52,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:52,366 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 236 treesize of output 161 [2024-10-14 13:57:52,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 13:57:52,918 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 386 treesize of output 136 [2024-10-14 13:57:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 13:57:53,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:57:53,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:57:53,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713911895] [2024-10-14 13:57:53,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713911895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:57:53,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:57:53,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-14 13:57:53,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483075844] [2024-10-14 13:57:53,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:57:53,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 13:57:53,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:57:53,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 13:57:53,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=263, Unknown=1, NotChecked=0, Total=342 [2024-10-14 13:57:53,147 INFO L87 Difference]: Start difference. First operand 552 states and 708 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 13:57:56,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:57:58,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:58:00,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:58:03,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:58:05,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:58:07,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:58:11,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:58:13,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:58:15,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:58:18,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:58:20,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:58:23,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:58:26,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:58:29,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]