./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-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 088876b530f5f297c2ed6ed519f2eb16dca02821d727525deef88d098a188170 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:51:37,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:51:37,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:51:37,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:51:37,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:51:37,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:51:37,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:51:37,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:51:37,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:51:37,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:51:37,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:51:37,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:51:37,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:51:37,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:51:37,757 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:51:37,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:51:37,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:51:37,758 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:51:37,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:51:37,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:51:37,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:51:37,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:51:37,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:51:37,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:51:37,762 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:51:37,762 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:51:37,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:51:37,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:51:37,763 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:51:37,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:51:37,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:51:37,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:51:37,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:51:37,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:51:37,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:51:37,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:51:37,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:51:37,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:51:37,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:51:37,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:51:37,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:51:37,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:51:37,765 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-clean/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-clean/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 -> 088876b530f5f297c2ed6ed519f2eb16dca02821d727525deef88d098a188170 [2024-10-11 13:51:37,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:51:38,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:51:38,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:51:38,020 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:51:38,020 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:51:38,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.i [2024-10-11 13:51:39,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:51:39,532 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:51:39,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.i [2024-10-11 13:51:39,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e0eb7a5bd/6ac39df1a44049d39ad6900513c57b11/FLAGaeebd6e56 [2024-10-11 13:51:39,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e0eb7a5bd/6ac39df1a44049d39ad6900513c57b11 [2024-10-11 13:51:39,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:51:39,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:51:39,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:51:39,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:51:39,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:51:39,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:51:39" (1/1) ... [2024-10-11 13:51:39,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c6f11c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:39, skipping insertion in model container [2024-10-11 13:51:39,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:51:39" (1/1) ... [2024-10-11 13:51:39,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:51:40,092 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-69.i[916,929] [2024-10-11 13:51:40,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:51:40,158 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:51:40,167 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-69.i[916,929] [2024-10-11 13:51:40,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:51:40,212 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:51:40,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40 WrapperNode [2024-10-11 13:51:40,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:51:40,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:51:40,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:51:40,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:51:40,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (1/1) ... [2024-10-11 13:51:40,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (1/1) ... [2024-10-11 13:51:40,258 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 469 [2024-10-11 13:51:40,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:51:40,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:51:40,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:51:40,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:51:40,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (1/1) ... [2024-10-11 13:51:40,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (1/1) ... [2024-10-11 13:51:40,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (1/1) ... [2024-10-11 13:51:40,293 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 18 writes are split as follows [0, 18]. [2024-10-11 13:51:40,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (1/1) ... [2024-10-11 13:51:40,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (1/1) ... [2024-10-11 13:51:40,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (1/1) ... [2024-10-11 13:51:40,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (1/1) ... [2024-10-11 13:51:40,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (1/1) ... [2024-10-11 13:51:40,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (1/1) ... [2024-10-11 13:51:40,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:51:40,328 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:51:40,328 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:51:40,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:51:40,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (1/1) ... [2024-10-11 13:51:40,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:51:40,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:51:40,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:51:40,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:51:40,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:51:40,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:51:40,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:51:40,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:51:40,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:51:40,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:51:40,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:51:40,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:51:40,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:51:40,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:51:40,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:51:40,411 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:51:40,412 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:51:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:51:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:51:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:51:40,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:51:40,513 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:51:40,514 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:51:40,921 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-11 13:51:40,922 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:51:40,956 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:51:40,957 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:51:40,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:40 BoogieIcfgContainer [2024-10-11 13:51:40,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:51:40,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:51:40,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:51:40,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:51:40,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:51:39" (1/3) ... [2024-10-11 13:51:40,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb83990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:51:40, skipping insertion in model container [2024-10-11 13:51:40,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:40" (2/3) ... [2024-10-11 13:51:40,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb83990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:51:40, skipping insertion in model container [2024-10-11 13:51:40,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:40" (3/3) ... [2024-10-11 13:51:40,966 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-69.i [2024-10-11 13:51:40,980 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:51:40,980 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:51:41,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:51:41,039 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;@70c08ec1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:51:41,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:51:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:51:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:51:41,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:41,053 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:41,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:41,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash 710784747, now seen corresponding path program 1 times [2024-10-11 13:51:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:41,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305361210] [2024-10-11 13:51:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:51:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:51:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:51:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:51:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:51:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:51:41,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:41,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305361210] [2024-10-11 13:51:41,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305361210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:41,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:41,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:51:41,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537381952] [2024-10-11 13:51:41,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:41,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:51:41,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:41,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:51:41,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:51:41,455 INFO L87 Difference]: Start difference. First operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:51:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:41,486 INFO L93 Difference]: Finished difference Result 171 states and 277 transitions. [2024-10-11 13:51:41,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:51:41,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-10-11 13:51:41,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:41,497 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:51:41,498 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 13:51:41,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:51:41,504 INFO L432 NwaCegarLoop]: 123 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, 123 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-11 13:51:41,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 13:51:41,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 13:51:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:51:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-10-11 13:51:41,547 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 114 [2024-10-11 13:51:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:41,547 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-10-11 13:51:41,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:51:41,548 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-10-11 13:51:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:51:41,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:41,550 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:41,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:51:41,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:41,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash 993285713, now seen corresponding path program 1 times [2024-10-11 13:51:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:41,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475523057] [2024-10-11 13:51:41,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:51:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:51:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:51:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:51:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:41,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:42,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:42,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:42,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:42,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:51:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:51:42,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:42,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475523057] [2024-10-11 13:51:42,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475523057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:42,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:42,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:51:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990321589] [2024-10-11 13:51:42,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:42,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:51:42,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:42,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:51:42,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:51:42,026 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:42,078 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2024-10-11 13:51:42,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:51:42,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-10-11 13:51:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:42,081 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:51:42,081 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 13:51:42,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-11 13:51:42,082 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:42,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 13:51:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 13:51:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:51:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-10-11 13:51:42,099 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 114 [2024-10-11 13:51:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:42,102 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-10-11 13:51:42,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-10-11 13:51:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:51:42,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:42,104 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:42,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:51:42,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:42,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:42,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2031215478, now seen corresponding path program 1 times [2024-10-11 13:51:42,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:42,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050556430] [2024-10-11 13:51:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:42,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:51:42,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498931395] [2024-10-11 13:51:42,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:42,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:51:42,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:51:42,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:51:42,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:51:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:42,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 13:51:42,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:42,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 13:51:42,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:42,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:42,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:42,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:42,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:42,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:42,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:42,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:51:42,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 37 [2024-10-11 13:51:42,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:51:42,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 19 [2024-10-11 13:51:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:51:42,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:42,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:42,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050556430] [2024-10-11 13:51:42,788 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 13:51:42,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498931395] [2024-10-11 13:51:42,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498931395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:42,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:42,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:51:42,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075015065] [2024-10-11 13:51:42,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:42,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:51:42,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:42,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:51:42,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:51:42,792 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:43,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:43,721 INFO L93 Difference]: Finished difference Result 214 states and 317 transitions. [2024-10-11 13:51:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:51:43,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:51:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:43,724 INFO L225 Difference]: With dead ends: 214 [2024-10-11 13:51:43,724 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 13:51:43,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:51:43,725 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:43,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 469 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:51:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 13:51:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 97. [2024-10-11 13:51:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:51:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-10-11 13:51:43,738 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 116 [2024-10-11 13:51:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:43,738 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-10-11 13:51:43,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-10-11 13:51:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:51:43,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:43,743 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:43,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:51:43,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:51:43,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:43,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2005586380, now seen corresponding path program 1 times [2024-10-11 13:51:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:43,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179583578] [2024-10-11 13:51:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:43,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:51:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:51:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:51:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:51:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:51:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:51:44,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:44,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179583578] [2024-10-11 13:51:44,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179583578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:44,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:44,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:51:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060477891] [2024-10-11 13:51:44,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:44,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:51:44,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:51:44,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:51:44,520 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:44,842 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-10-11 13:51:44,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:51:44,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:51:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:44,844 INFO L225 Difference]: With dead ends: 239 [2024-10-11 13:51:44,844 INFO L226 Difference]: Without dead ends: 143 [2024-10-11 13:51:44,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:51:44,846 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 54 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:44,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 399 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:51:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-11 13:51:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2024-10-11 13:51:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.425) internal successors, (171), 121 states have internal predecessors, (171), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 205 transitions. [2024-10-11 13:51:44,856 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 205 transitions. Word has length 116 [2024-10-11 13:51:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:44,857 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 205 transitions. [2024-10-11 13:51:44,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 205 transitions. [2024-10-11 13:51:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:51:44,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:44,861 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:44,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:51:44,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:44,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:44,862 INFO L85 PathProgramCache]: Analyzing trace with hash 37070772, now seen corresponding path program 1 times [2024-10-11 13:51:44,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:44,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873535721] [2024-10-11 13:51:44,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:51:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:51:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:51:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:51:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:51:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:51:45,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:45,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873535721] [2024-10-11 13:51:45,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873535721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:45,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:45,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:51:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101366822] [2024-10-11 13:51:45,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:45,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:51:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:45,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:51:45,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:51:45,487 INFO L87 Difference]: Start difference. First operand 140 states and 205 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:46,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:46,055 INFO L93 Difference]: Finished difference Result 386 states and 560 transitions. [2024-10-11 13:51:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:51:46,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:51:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:46,058 INFO L225 Difference]: With dead ends: 386 [2024-10-11 13:51:46,059 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 13:51:46,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:51:46,060 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 134 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:46,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 468 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:51:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 13:51:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 152. [2024-10-11 13:51:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 132 states have (on average 1.4393939393939394) internal successors, (190), 133 states have internal predecessors, (190), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2024-10-11 13:51:46,071 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 116 [2024-10-11 13:51:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:46,071 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2024-10-11 13:51:46,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2024-10-11 13:51:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:51:46,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:46,075 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:46,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:51:46,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:46,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash 295236210, now seen corresponding path program 1 times [2024-10-11 13:51:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:46,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961304440] [2024-10-11 13:51:46,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:46,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:51:46,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [18018639] [2024-10-11 13:51:46,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:46,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:51:46,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:51:46,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:51:46,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:51:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:46,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 13:51:46,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:46,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:46,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:46,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:46,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:46,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:46,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 13:51:46,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:51:46,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 37 [2024-10-11 13:51:46,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:51:46,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 19 [2024-10-11 13:51:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:51:46,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:46,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961304440] [2024-10-11 13:51:46,642 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 13:51:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18018639] [2024-10-11 13:51:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18018639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:46,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:46,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:51:46,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389269508] [2024-10-11 13:51:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:46,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:51:46,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:46,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:51:46,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:51:46,644 INFO L87 Difference]: Start difference. First operand 152 states and 224 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:47,697 INFO L93 Difference]: Finished difference Result 373 states and 550 transitions. [2024-10-11 13:51:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:51:47,701 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:51:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:47,702 INFO L225 Difference]: With dead ends: 373 [2024-10-11 13:51:47,702 INFO L226 Difference]: Without dead ends: 222 [2024-10-11 13:51:47,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:51:47,703 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 48 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:47,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 530 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 13:51:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-11 13:51:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 166. [2024-10-11 13:51:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 147 states have internal predecessors, (211), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 245 transitions. [2024-10-11 13:51:47,725 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 245 transitions. Word has length 116 [2024-10-11 13:51:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:47,726 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 245 transitions. [2024-10-11 13:51:47,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-10-11 13:51:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:51:47,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:47,727 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:47,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 13:51:47,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:51:47,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:47,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash -385631054, now seen corresponding path program 1 times [2024-10-11 13:51:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:47,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066117692] [2024-10-11 13:51:47,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:51:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:51:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:51:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:51:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:51:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:51:48,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066117692] [2024-10-11 13:51:48,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066117692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:48,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:48,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:51:48,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052170579] [2024-10-11 13:51:48,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:48,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:51:48,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:48,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:51:48,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:51:48,296 INFO L87 Difference]: Start difference. First operand 166 states and 245 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:48,630 INFO L93 Difference]: Finished difference Result 376 states and 547 transitions. [2024-10-11 13:51:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:51:48,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:51:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:48,633 INFO L225 Difference]: With dead ends: 376 [2024-10-11 13:51:48,633 INFO L226 Difference]: Without dead ends: 211 [2024-10-11 13:51:48,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:51:48,634 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 54 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:48,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:51:48,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-11 13:51:48,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 114. [2024-10-11 13:51:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:51:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2024-10-11 13:51:48,648 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 116 [2024-10-11 13:51:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:48,648 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2024-10-11 13:51:48,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2024-10-11 13:51:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:51:48,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:48,649 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:48,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:51:48,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:48,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash -407954285, now seen corresponding path program 1 times [2024-10-11 13:51:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:48,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158022004] [2024-10-11 13:51:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:48,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:51:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:51:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:51:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:51:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:51:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:51:48,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:48,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158022004] [2024-10-11 13:51:48,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158022004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:48,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:48,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:51:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410396361] [2024-10-11 13:51:48,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:48,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:51:48,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:48,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:51:48,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:51:48,983 INFO L87 Difference]: Start difference. First operand 114 states and 165 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:49,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:49,322 INFO L93 Difference]: Finished difference Result 300 states and 433 transitions. [2024-10-11 13:51:49,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:51:49,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-11 13:51:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:49,323 INFO L225 Difference]: With dead ends: 300 [2024-10-11 13:51:49,324 INFO L226 Difference]: Without dead ends: 187 [2024-10-11 13:51:49,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:51:49,324 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 96 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:49,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 726 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:51:49,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-11 13:51:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 112. [2024-10-11 13:51:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:51:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2024-10-11 13:51:49,333 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 117 [2024-10-11 13:51:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:49,333 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2024-10-11 13:51:49,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2024-10-11 13:51:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:51:49,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:49,334 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:49,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:51:49,335 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:49,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:49,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1667874510, now seen corresponding path program 1 times [2024-10-11 13:51:49,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:49,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927353694] [2024-10-11 13:51:49,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:49,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:51:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:51:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:51:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:51:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:51:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:51:49,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:49,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927353694] [2024-10-11 13:51:49,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927353694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:49,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:49,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:51:49,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90674440] [2024-10-11 13:51:49,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:49,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:51:49,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:49,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:51:49,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:51:49,644 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:49,919 INFO L93 Difference]: Finished difference Result 313 states and 449 transitions. [2024-10-11 13:51:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:51:49,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-11 13:51:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:49,921 INFO L225 Difference]: With dead ends: 313 [2024-10-11 13:51:49,921 INFO L226 Difference]: Without dead ends: 202 [2024-10-11 13:51:49,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:51:49,922 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 66 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:49,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 453 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:51:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-11 13:51:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2024-10-11 13:51:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 171 states have (on average 1.3976608187134503) internal successors, (239), 172 states have internal predecessors, (239), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:51:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 285 transitions. [2024-10-11 13:51:49,944 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 285 transitions. Word has length 117 [2024-10-11 13:51:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:49,945 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 285 transitions. [2024-10-11 13:51:49,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 285 transitions. [2024-10-11 13:51:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:51:49,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:49,946 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:49,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:51:49,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:49,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:49,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1441215003, now seen corresponding path program 1 times [2024-10-11 13:51:49,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:49,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991850019] [2024-10-11 13:51:49,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:49,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:51:50,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434037462] [2024-10-11 13:51:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:50,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:51:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:51:50,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:51:50,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 13:51:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:50,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 13:51:50,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:50,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:51:50,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 37 [2024-10-11 13:51:50,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:51:50,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 37 [2024-10-11 13:51:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:51:50,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:50,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:50,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991850019] [2024-10-11 13:51:50,421 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 13:51:50,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434037462] [2024-10-11 13:51:50,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434037462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:50,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:50,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:51:50,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979239986] [2024-10-11 13:51:50,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:50,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:51:50,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:51:50,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:51:50,423 INFO L87 Difference]: Start difference. First operand 199 states and 285 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:51,969 INFO L93 Difference]: Finished difference Result 544 states and 781 transitions. [2024-10-11 13:51:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:51:51,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-10-11 13:51:51,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:51,974 INFO L225 Difference]: With dead ends: 544 [2024-10-11 13:51:51,974 INFO L226 Difference]: Without dead ends: 346 [2024-10-11 13:51:51,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:51:51,975 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 52 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:51,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 259 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 13:51:51,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-11 13:51:51,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 285. [2024-10-11 13:51:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 257 states have (on average 1.4280155642023347) internal successors, (367), 258 states have internal predecessors, (367), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:51:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 413 transitions. [2024-10-11 13:51:51,992 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 413 transitions. Word has length 120 [2024-10-11 13:51:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:51,995 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 413 transitions. [2024-10-11 13:51:51,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 413 transitions. [2024-10-11 13:51:51,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:51:51,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:51,996 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:52,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 13:51:52,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:51:52,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:52,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash -740150425, now seen corresponding path program 1 times [2024-10-11 13:51:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:52,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971257841] [2024-10-11 13:51:52,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:51:52,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440938775] [2024-10-11 13:51:52,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:52,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:51:52,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:51:52,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:51:52,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 13:51:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:51:52,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:51:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:51:52,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:51:52,841 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:51:52,841 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:51:52,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 13:51:53,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 13:51:53,049 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:53,103 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:51:53,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:51:53 BoogieIcfgContainer [2024-10-11 13:51:53,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:51:53,105 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:51:53,105 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:51:53,106 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:51:53,106 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:40" (3/4) ... [2024-10-11 13:51:53,107 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:51:53,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:51:53,109 INFO L158 Benchmark]: Toolchain (without parser) took 13185.79ms. Allocated memory was 186.6MB in the beginning and 331.4MB in the end (delta: 144.7MB). Free memory was 154.8MB in the beginning and 266.6MB in the end (delta: -111.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-10-11 13:51:53,109 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory was 75.7MB in the beginning and 75.5MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:51:53,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.00ms. Allocated memory is still 186.6MB. Free memory was 154.8MB in the beginning and 138.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:51:53,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.46ms. Allocated memory is still 186.6MB. Free memory was 138.6MB in the beginning and 134.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:51:53,110 INFO L158 Benchmark]: Boogie Preprocessor took 68.56ms. Allocated memory is still 186.6MB. Free memory was 134.5MB in the beginning and 130.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:51:53,110 INFO L158 Benchmark]: RCFGBuilder took 630.56ms. Allocated memory is still 186.6MB. Free memory was 130.3MB in the beginning and 128.4MB in the end (delta: 1.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:51:53,110 INFO L158 Benchmark]: TraceAbstraction took 12145.43ms. Allocated memory was 186.6MB in the beginning and 331.4MB in the end (delta: 144.7MB). Free memory was 128.4MB in the beginning and 266.6MB in the end (delta: -138.2MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-10-11 13:51:53,110 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 331.4MB. Free memory is still 266.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:51:53,111 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory was 75.7MB in the beginning and 75.5MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.00ms. Allocated memory is still 186.6MB. Free memory was 154.8MB in the beginning and 138.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.46ms. Allocated memory is still 186.6MB. Free memory was 138.6MB in the beginning and 134.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.56ms. Allocated memory is still 186.6MB. Free memory was 134.5MB in the beginning and 130.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 630.56ms. Allocated memory is still 186.6MB. Free memory was 130.3MB in the beginning and 128.4MB in the end (delta: 1.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12145.43ms. Allocated memory was 186.6MB in the beginning and 331.4MB in the end (delta: 144.7MB). Free memory was 128.4MB in the beginning and 266.6MB in the end (delta: -138.2MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 331.4MB. Free memory is still 266.6MB. 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 118. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L91] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L92] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L95] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ulong() [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_8 = __VERIFIER_nondet_char() [L104] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] RET updateVariables() [L127] CALL step() [L52] EXPR WrapperStruct00.var_1_2 [L52] EXPR WrapperStruct00.var_1_4 [L52] EXPR WrapperStruct00.var_1_5 [L52] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L52] EXPR (((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3) [L52] EXPR WrapperStruct00.var_1_3 [L52] EXPR (((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L52] COND TRUE WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3))) [L53] EXPR WrapperStruct00.var_1_8 [L53] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_8 [L65] EXPR WrapperStruct00.var_1_5 [L65] unsigned long int stepLocal_1 = WrapperStruct00.var_1_5; [L66] EXPR WrapperStruct00.var_1_2 [L66] EXPR WrapperStruct00.var_1_3 [L66] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L66] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) [L66] EXPR WrapperStruct00.var_1_3 [L66] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=0] [L66] unsigned long int stepLocal_0 = WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))); [L67] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] COND FALSE !(stepLocal_0 < WrapperStruct00.var_1_5) [L74] EXPR WrapperStruct00.var_1_9 [L74] unsigned char stepLocal_3 = WrapperStruct00.var_1_9; [L75] EXPR WrapperStruct00.var_1_1 [L75] EXPR WrapperStruct00.var_1_7 [L75] signed long int stepLocal_2 = WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7; [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_8 [L76] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L76] COND FALSE !(((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && stepLocal_3) [L87] EXPR WrapperStruct00.var_1_13 [L87] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_13 [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR WrapperStruct00.var_1_2 [L118] EXPR WrapperStruct00.var_1_3 [L118] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) [L118] EXPR WrapperStruct00.var_1_3 [L118] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1 [L118] EXPR ((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4))))) [L118] EXPR WrapperStruct00.var_1_2 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR WrapperStruct00.var_1_5 [L118] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3) [L118] EXPR WrapperStruct00.var_1_3 [L118] EXPR (((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))) [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_8 [L118] EXPR (WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))))) && ((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))))) && ((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_8 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR ((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9 [L118] EXPR WrapperStruct00.var_1_9 [L118] EXPR ((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR (((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) [L118] EXPR WrapperStruct00.var_1_11 [L118] EXPR WrapperStruct00.var_1_13 [L118] EXPR (((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] EXPR ((((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))))) && ((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1] [L118-L119] return ((((WrapperStruct00.var_1_2 * ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < WrapperStruct00.var_1_5) ? ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_7))) : 1) && ((WrapperStruct00.var_1_2 < (((((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) > (WrapperStruct00.var_1_3)) ? ((WrapperStruct00.var_1_4 * WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_3)))) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_9 || WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : ((WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((signed char) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((signed char) -4)))))) && ((((WrapperStruct00.var_1_7 + WrapperStruct00.var_1_8) == WrapperStruct00.var_1_4) && WrapperStruct00.var_1_9) ? ((! WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_7) != WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_13))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 553 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 553 mSDsluCounter, 4287 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3152 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3239 IncrementalHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 1135 mSDtfsCounter, 3239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=10, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 421 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1754 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1152 ConstructedInterpolants, 0 QuantifiedInterpolants, 3080 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1189 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4200/4200 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-11 13:51:53,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 088876b530f5f297c2ed6ed519f2eb16dca02821d727525deef88d098a188170 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:51:55,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:51:55,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:51:55,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:51:55,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:51:55,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:51:55,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:51:55,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:51:55,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:51:55,170 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:51:55,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:51:55,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:51:55,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:51:55,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:51:55,173 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:51:55,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:51:55,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:51:55,174 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:51:55,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:51:55,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:51:55,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:51:55,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:51:55,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:51:55,177 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:51:55,178 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:51:55,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:51:55,178 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:51:55,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:51:55,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:51:55,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:51:55,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:51:55,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:51:55,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:51:55,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:51:55,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:51:55,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:51:55,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:51:55,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:51:55,180 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:51:55,180 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:51:55,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:51:55,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:51:55,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:51:55,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:51:55,182 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:51:55,182 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-clean/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-clean/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 -> 088876b530f5f297c2ed6ed519f2eb16dca02821d727525deef88d098a188170 [2024-10-11 13:51:55,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:51:55,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:51:55,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:51:55,474 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:51:55,475 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:51:55,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.i [2024-10-11 13:51:56,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:51:56,980 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:51:56,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-69.i [2024-10-11 13:51:56,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d65a2c026/668618263a734e8e879e53776a4df24a/FLAG4485a8084 [2024-10-11 13:51:57,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d65a2c026/668618263a734e8e879e53776a4df24a [2024-10-11 13:51:57,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:51:57,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:51:57,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:51:57,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:51:57,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:51:57,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bdbf8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57, skipping insertion in model container [2024-10-11 13:51:57,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:51:57,213 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-69.i[916,929] [2024-10-11 13:51:57,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:51:57,291 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:51:57,302 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-69.i[916,929] [2024-10-11 13:51:57,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:51:57,382 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:51:57,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57 WrapperNode [2024-10-11 13:51:57,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:51:57,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:51:57,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:51:57,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:51:57,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,450 INFO L138 Inliner]: procedures = 36, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 468 [2024-10-11 13:51:57,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:51:57,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:51:57,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:51:57,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:51:57,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,518 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 18 writes are split as follows [0, 18]. [2024-10-11 13:51:57,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:51:57,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:51:57,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:51:57,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:51:57,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (1/1) ... [2024-10-11 13:51:57,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:51:57,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:51:57,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:51:57,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:51:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:51:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:51:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:51:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:51:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:51:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:51:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:51:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:51:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:51:57,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:51:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:51:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:51:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:51:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:51:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:51:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:51:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:51:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:51:57,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:51:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:51:57,630 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:51:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:51:57,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:51:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:51:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:51:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:51:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:51:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:51:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:51:57,733 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:51:57,744 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:51:58,431 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-11 13:51:58,432 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:51:58,475 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:51:58,477 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:51:58,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:58 BoogieIcfgContainer [2024-10-11 13:51:58,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:51:58,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:51:58,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:51:58,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:51:58,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:51:57" (1/3) ... [2024-10-11 13:51:58,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409b7992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:51:58, skipping insertion in model container [2024-10-11 13:51:58,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:57" (2/3) ... [2024-10-11 13:51:58,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409b7992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:51:58, skipping insertion in model container [2024-10-11 13:51:58,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:58" (3/3) ... [2024-10-11 13:51:58,486 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-69.i [2024-10-11 13:51:58,500 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:51:58,501 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:51:58,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:51:58,560 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;@2b1605f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:51:58,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:51:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:51:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:51:58,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:58,576 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:58,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:58,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:58,581 INFO L85 PathProgramCache]: Analyzing trace with hash 710784747, now seen corresponding path program 1 times [2024-10-11 13:51:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:58,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520360878] [2024-10-11 13:51:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:58,595 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-11 13:51:58,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:58,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 13:51:58,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:58,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:51:58,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-11 13:51:58,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:58,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:51:58,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520360878] [2024-10-11 13:51:58,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520360878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:58,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:58,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:51:58,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213194412] [2024-10-11 13:51:58,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:58,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:51:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:51:58,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:51:58,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:51:58,889 INFO L87 Difference]: Start difference. First operand has 87 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 70 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:51:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:58,929 INFO L93 Difference]: Finished difference Result 171 states and 277 transitions. [2024-10-11 13:51:58,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:51:58,931 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-10-11 13:51:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:58,937 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:51:58,937 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 13:51:58,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-11 13:51:58,943 INFO L432 NwaCegarLoop]: 123 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, 123 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-11 13:51:58,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 13:51:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 13:51:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:51:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-10-11 13:51:58,985 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 114 [2024-10-11 13:51:58,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:58,987 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-10-11 13:51:58,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:51:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-10-11 13:51:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:51:58,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:58,992 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:59,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:51:59,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 13:51:59,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:59,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:59,194 INFO L85 PathProgramCache]: Analyzing trace with hash 993285713, now seen corresponding path program 1 times [2024-10-11 13:51:59,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:59,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746901572] [2024-10-11 13:51:59,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:59,195 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-11 13:51:59,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:59,198 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 13:51:59,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:59,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:51:59,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:51:59,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:59,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:51:59,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746901572] [2024-10-11 13:51:59,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746901572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:59,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:59,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:51:59,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613866073] [2024-10-11 13:51:59,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:59,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:51:59,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:51:59,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:51:59,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:51:59,449 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:59,496 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2024-10-11 13:51:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:51:59,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-10-11 13:51:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:59,501 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:51:59,501 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 13:51:59,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 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-11 13:51:59,503 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:59,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:59,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 13:51:59,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 13:51:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:51:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-10-11 13:51:59,517 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 114 [2024-10-11 13:51:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:59,523 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-10-11 13:51:59,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:51:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-10-11 13:51:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:51:59,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:59,526 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:59,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:51:59,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 13:51:59,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:59,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:59,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2031215478, now seen corresponding path program 1 times [2024-10-11 13:51:59,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:59,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695975849] [2024-10-11 13:51:59,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:59,734 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-11 13:51:59,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:59,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 13:51:59,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:52:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:52:00,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:52:00,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:52:00,068 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-11 13:52:00,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:52:00,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 44 [2024-10-11 13:52:03,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:52:03,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 20 [2024-10-11 13:52:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:52:03,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:52:03,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:52:03,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695975849] [2024-10-11 13:52:03,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695975849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:52:03,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:52:03,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:52:03,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479612196] [2024-10-11 13:52:03,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:52:03,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:52:03,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:52:03,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:52:03,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=65, Unknown=1, NotChecked=0, Total=90 [2024-10-11 13:52:03,914 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:52:09,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:52:13,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:52:17,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:52:21,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:52:25,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:52:29,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:52:33,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:52:37,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:52:41,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:52:45,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:52:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:52:47,805 INFO L93 Difference]: Finished difference Result 214 states and 317 transitions. [2024-10-11 13:52:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:52:47,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:52:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:52:47,812 INFO L225 Difference]: With dead ends: 214 [2024-10-11 13:52:47,812 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 13:52:47,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=31, Invalid=78, Unknown=1, NotChecked=0, Total=110 [2024-10-11 13:52:47,813 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 92 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:52:47,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 469 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 471 Invalid, 10 Unknown, 0 Unchecked, 43.7s Time] [2024-10-11 13:52:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 13:52:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2024-10-11 13:52:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:52:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2024-10-11 13:52:47,831 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 116 [2024-10-11 13:52:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:52:47,831 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2024-10-11 13:52:47,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:52:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2024-10-11 13:52:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:52:47,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:52:47,833 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:52:47,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 13:52:48,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 13:52:48,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:52:48,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:52:48,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2005586380, now seen corresponding path program 1 times [2024-10-11 13:52:48,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:52:48,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968745761] [2024-10-11 13:52:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:52:48,035 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-11 13:52:48,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:52:48,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 13:52:48,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:52:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:52:48,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:52:48,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:52:48,324 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-11 13:52:48,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:52:48,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 22 [2024-10-11 13:52:48,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:52:48,397 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 34 treesize of output 10 [2024-10-11 13:52:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:52:48,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:52:48,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:52:48,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968745761] [2024-10-11 13:52:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968745761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:52:48,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:52:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:52:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001294667] [2024-10-11 13:52:48,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:52:48,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:52:48,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:52:48,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:52:48,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:52:48,413 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:52:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:52:49,126 INFO L93 Difference]: Finished difference Result 235 states and 344 transitions. [2024-10-11 13:52:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:52:49,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-11 13:52:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:52:49,128 INFO L225 Difference]: With dead ends: 235 [2024-10-11 13:52:49,128 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 13:52:49,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:52:49,132 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 54 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:52:49,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 337 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:52:49,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 13:52:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-10-11 13:52:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.4152542372881356) internal successors, (167), 119 states have internal predecessors, (167), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:52:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2024-10-11 13:52:49,143 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 116 [2024-10-11 13:52:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:52:49,143 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2024-10-11 13:52:49,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:52:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2024-10-11 13:52:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:52:49,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:52:49,145 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:52:49,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:52:49,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 13:52:49,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:52:49,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:52:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash 37070772, now seen corresponding path program 1 times [2024-10-11 13:52:49,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:52:49,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521681093] [2024-10-11 13:52:49,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:52:49,347 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-11 13:52:49,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:52:49,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 13:52:49,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:52:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:52:49,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:52:49,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:52:49,680 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-11 13:52:49,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:52:49,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2024-10-11 13:52:53,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:52:53,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 19 [2024-10-11 13:52:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:52:53,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:52:53,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:52:53,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521681093] [2024-10-11 13:52:53,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521681093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:52:53,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:52:53,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:52:53,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788188939] [2024-10-11 13:52:53,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:52:53,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:52:53,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:52:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:52:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=19, Unknown=1, NotChecked=0, Total=30 [2024-10-11 13:52:53,835 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:52:56,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:53:00,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:53:04,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:53:08,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:53:12,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:53:16,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]