./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-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2633f484e0865e6e431657ee89a0a14b8fb20a20b6a1493f613e45a885039ef4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:01:23,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:01:24,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:01:24,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:01:24,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:01:24,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:01:24,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:01:24,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:01:24,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:01:24,045 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:01:24,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:01:24,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:01:24,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:01:24,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:01:24,048 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:01:24,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:01:24,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:01:24,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:01:24,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:01:24,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:01:24,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:01:24,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:01:24,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:01:24,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:01:24,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:01:24,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:01:24,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:01:24,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:01:24,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:01:24,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:01:24,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:01:24,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:01:24,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:01:24,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:01:24,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:01:24,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:01:24,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:01:24,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:01:24,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:01:24,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:01:24,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:01:24,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:01:24,059 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2633f484e0865e6e431657ee89a0a14b8fb20a20b6a1493f613e45a885039ef4 [2024-10-14 14:01:24,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:01:24,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:01:24,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:01:24,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:01:24,344 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:01:24,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i [2024-10-14 14:01:25,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:01:25,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:01:25,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i [2024-10-14 14:01:25,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b9c40ca/90b59e36b20745c88e22595e3296501d/FLAG3b42cacd1 [2024-10-14 14:01:26,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2b9c40ca/90b59e36b20745c88e22595e3296501d [2024-10-14 14:01:26,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:01:26,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:01:26,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:01:26,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:01:26,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:01:26,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:26,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606116d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26, skipping insertion in model container [2024-10-14 14:01:26,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:26,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:01:26,562 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-86.i[916,929] [2024-10-14 14:01:26,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:01:26,690 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:01:26,701 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-86.i[916,929] [2024-10-14 14:01:26,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:01:26,780 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:01:26,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26 WrapperNode [2024-10-14 14:01:26,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:01:26,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:01:26,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:01:26,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:01:26,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:26,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:26,877 INFO L138 Inliner]: procedures = 29, calls = 243, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 762 [2024-10-14 14:01:26,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:01:26,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:01:26,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:01:26,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:01:26,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:26,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:26,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:26,950 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 18]. The 21 writes are split as follows [0, 21]. [2024-10-14 14:01:26,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:26,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:26,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:27,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:27,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:27,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:27,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:01:27,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:01:27,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:01:27,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:01:27,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (1/1) ... [2024-10-14 14:01:27,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:01:27,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:27,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:01:27,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:01:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:01:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 14:01:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 14:01:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 14:01:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 14:01:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 14:01:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 14:01:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 14:01:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 14:01:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 14:01:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 14:01:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:01:27,128 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:01:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:01:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 14:01:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:01:27,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:01:27,247 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:01:27,250 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:01:27,893 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2024-10-14 14:01:27,894 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:01:27,934 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:01:27,934 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:01:27,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:01:27 BoogieIcfgContainer [2024-10-14 14:01:27,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:01:27,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:01:27,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:01:27,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:01:27,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:01:26" (1/3) ... [2024-10-14 14:01:27,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d82fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:01:27, skipping insertion in model container [2024-10-14 14:01:27,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:26" (2/3) ... [2024-10-14 14:01:27,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d82fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:01:27, skipping insertion in model container [2024-10-14 14:01:27,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:01:27" (3/3) ... [2024-10-14 14:01:27,943 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-86.i [2024-10-14 14:01:27,960 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:01:27,960 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:01:28,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:01:28,029 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;@787dee49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:01:28,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:01:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 124 states have (on average 1.4596774193548387) internal successors, (181), 125 states have internal predecessors, (181), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-14 14:01:28,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:28,047 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:28,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:28,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1846203609, now seen corresponding path program 1 times [2024-10-14 14:01:28,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:28,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434702177] [2024-10-14 14:01:28,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:01:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:01:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:01:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:01:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 14:01:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 14:01:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 14:01:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 14:01:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 14:01:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 14:01:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 14:01:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 14:01:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 14:01:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 14:01:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 14:01:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 14:01:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 14:01:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-14 14:01:28,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:28,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434702177] [2024-10-14 14:01:28,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434702177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:28,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:28,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:01:28,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428096146] [2024-10-14 14:01:28,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:28,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:01:28,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:28,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:01:28,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:01:28,663 INFO L87 Difference]: Start difference. First operand has 152 states, 124 states have (on average 1.4596774193548387) internal successors, (181), 125 states have internal predecessors, (181), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:28,716 INFO L93 Difference]: Finished difference Result 301 states and 485 transitions. [2024-10-14 14:01:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:01:28,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 180 [2024-10-14 14:01:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:28,728 INFO L225 Difference]: With dead ends: 301 [2024-10-14 14:01:28,728 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 14:01:28,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:01:28,741 INFO L432 NwaCegarLoop]: 222 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, 222 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:28,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:01:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 14:01:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-14 14:01:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 123 states have internal predecessors, (176), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2024-10-14 14:01:28,812 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 180 [2024-10-14 14:01:28,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:28,813 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2024-10-14 14:01:28,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2024-10-14 14:01:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-14 14:01:28,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:28,822 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:28,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:01:28,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:28,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash 260554783, now seen corresponding path program 1 times [2024-10-14 14:01:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:28,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117253597] [2024-10-14 14:01:28,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:28,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:01:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:01:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:01:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:01:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 14:01:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 14:01:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 14:01:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 14:01:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 14:01:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 14:01:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 14:01:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 14:01:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 14:01:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 14:01:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 14:01:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 14:01:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 14:01:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-14 14:01:29,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:29,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117253597] [2024-10-14 14:01:29,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117253597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:29,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:29,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:01:29,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921711410] [2024-10-14 14:01:29,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:29,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:01:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:29,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:01:29,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:29,249 INFO L87 Difference]: Start difference. First operand 150 states and 226 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:29,316 INFO L93 Difference]: Finished difference Result 301 states and 454 transitions. [2024-10-14 14:01:29,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:01:29,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 180 [2024-10-14 14:01:29,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:29,319 INFO L225 Difference]: With dead ends: 301 [2024-10-14 14:01:29,322 INFO L226 Difference]: Without dead ends: 152 [2024-10-14 14:01:29,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:29,324 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 653 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-14 14:01:29,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 653 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:01:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-14 14:01:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-10-14 14:01:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 125 states have (on average 1.424) internal successors, (178), 125 states have internal predecessors, (178), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 228 transitions. [2024-10-14 14:01:29,352 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 228 transitions. Word has length 180 [2024-10-14 14:01:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:29,356 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 228 transitions. [2024-10-14 14:01:29,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 228 transitions. [2024-10-14 14:01:29,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-14 14:01:29,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:29,359 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:29,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:01:29,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:29,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:29,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2103030497, now seen corresponding path program 1 times [2024-10-14 14:01:29,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:29,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373283629] [2024-10-14 14:01:29,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:29,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:01:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:01:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:01:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:01:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 14:01:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 14:01:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 14:01:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 14:01:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 14:01:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 14:01:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 14:01:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 14:01:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 14:01:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 14:01:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 14:01:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 14:01:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 14:01:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-14 14:01:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:29,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373283629] [2024-10-14 14:01:29,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373283629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:29,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:29,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:01:29,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812313273] [2024-10-14 14:01:29,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:29,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:01:29,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:29,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:01:29,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:29,685 INFO L87 Difference]: Start difference. First operand 152 states and 228 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 14:01:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:29,736 INFO L93 Difference]: Finished difference Result 306 states and 459 transitions. [2024-10-14 14:01:29,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:01:29,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 180 [2024-10-14 14:01:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:29,740 INFO L225 Difference]: With dead ends: 306 [2024-10-14 14:01:29,740 INFO L226 Difference]: Without dead ends: 155 [2024-10-14 14:01:29,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:29,742 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 1 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:29,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 653 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:01:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-14 14:01:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-10-14 14:01:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 127 states have (on average 1.4173228346456692) internal successors, (180), 127 states have internal predecessors, (180), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 230 transitions. [2024-10-14 14:01:29,759 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 230 transitions. Word has length 180 [2024-10-14 14:01:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:29,760 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 230 transitions. [2024-10-14 14:01:29,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 14:01:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 230 transitions. [2024-10-14 14:01:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-14 14:01:29,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:29,764 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:29,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:01:29,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:29,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:29,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2103090079, now seen corresponding path program 1 times [2024-10-14 14:01:29,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:29,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515370598] [2024-10-14 14:01:29,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:29,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:01:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:01:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:01:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:01:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 14:01:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 14:01:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 14:01:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 14:01:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 14:01:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 14:01:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 14:01:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 14:01:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 14:01:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 14:01:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 14:01:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 14:01:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 14:01:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-14 14:01:30,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:30,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515370598] [2024-10-14 14:01:30,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515370598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:30,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:30,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:01:30,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97807018] [2024-10-14 14:01:30,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:30,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:01:30,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:01:30,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:01:30,675 INFO L87 Difference]: Start difference. First operand 154 states and 230 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 14:01:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:31,116 INFO L93 Difference]: Finished difference Result 404 states and 603 transitions. [2024-10-14 14:01:31,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:01:31,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 180 [2024-10-14 14:01:31,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:31,119 INFO L225 Difference]: With dead ends: 404 [2024-10-14 14:01:31,119 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 14:01:31,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:01:31,121 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 127 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:31,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 576 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:01:31,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 14:01:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2024-10-14 14:01:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 214 states have (on average 1.4439252336448598) internal successors, (309), 215 states have internal predecessors, (309), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 14:01:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 371 transitions. [2024-10-14 14:01:31,136 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 371 transitions. Word has length 180 [2024-10-14 14:01:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:31,137 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 371 transitions. [2024-10-14 14:01:31,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 14:01:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 371 transitions. [2024-10-14 14:01:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-14 14:01:31,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:31,140 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:31,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:01:31,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:31,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:31,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1578760900, now seen corresponding path program 1 times [2024-10-14 14:01:31,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:31,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510126831] [2024-10-14 14:01:31,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:31,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:01:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:01:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:01:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:01:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 14:01:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 14:01:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 14:01:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 14:01:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 14:01:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 14:01:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 14:01:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 14:01:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 14:01:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 14:01:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 14:01:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 14:01:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 14:01:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-14 14:01:33,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:33,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510126831] [2024-10-14 14:01:33,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510126831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:33,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:33,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:01:33,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405382934] [2024-10-14 14:01:33,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:33,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:01:33,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:33,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:01:33,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:33,326 INFO L87 Difference]: Start difference. First operand 248 states and 371 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:33,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:33,862 INFO L93 Difference]: Finished difference Result 497 states and 742 transitions. [2024-10-14 14:01:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:01:33,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 182 [2024-10-14 14:01:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:33,866 INFO L225 Difference]: With dead ends: 497 [2024-10-14 14:01:33,868 INFO L226 Difference]: Without dead ends: 250 [2024-10-14 14:01:33,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 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-14 14:01:33,871 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 110 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:33,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 593 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 14:01:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-14 14:01:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2024-10-14 14:01:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 214 states have (on average 1.439252336448598) internal successors, (308), 215 states have internal predecessors, (308), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 14:01:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 370 transitions. [2024-10-14 14:01:33,891 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 370 transitions. Word has length 182 [2024-10-14 14:01:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:33,892 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 370 transitions. [2024-10-14 14:01:33,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 370 transitions. [2024-10-14 14:01:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-14 14:01:33,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:33,894 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:33,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:01:33,894 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:33,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1127858494, now seen corresponding path program 1 times [2024-10-14 14:01:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:33,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324521189] [2024-10-14 14:01:33,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:33,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:01:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:01:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:01:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:01:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:01:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:01:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:01:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:01:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:01:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:01:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 14:01:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:01:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 14:01:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 14:01:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 14:01:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 14:01:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 14:01:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 14:01:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 14:01:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 14:01:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 14:01:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-14 14:01:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 14:01:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 14:01:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 14:01:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-14 14:01:34,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:01:34,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324521189] [2024-10-14 14:01:34,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324521189] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:01:34,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019864884] [2024-10-14 14:01:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:34,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:01:34,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:34,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:01:34,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 14:01:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:35,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 14:01:35,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:35,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:35,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2024-10-14 14:01:35,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:35,471 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 56 treesize of output 40 [2024-10-14 14:01:35,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:35,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2024-10-14 14:01:35,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:35,544 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 63 treesize of output 23 [2024-10-14 14:01:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 162 proven. 3 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-14 14:01:35,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:01:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-14 14:01:35,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019864884] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:01:35,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:01:35,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 16 [2024-10-14 14:01:35,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427526513] [2024-10-14 14:01:35,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:01:35,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 14:01:35,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:01:35,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 14:01:35,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-10-14 14:01:35,895 INFO L87 Difference]: Start difference. First operand 248 states and 370 transitions. Second operand has 16 states, 14 states have (on average 6.071428571428571) internal successors, (85), 16 states have internal predecessors, (85), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2024-10-14 14:01:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:37,326 INFO L93 Difference]: Finished difference Result 506 states and 748 transitions. [2024-10-14 14:01:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 14:01:37,327 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.071428571428571) internal successors, (85), 16 states have internal predecessors, (85), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) Word has length 182 [2024-10-14 14:01:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:37,329 INFO L225 Difference]: With dead ends: 506 [2024-10-14 14:01:37,329 INFO L226 Difference]: Without dead ends: 259 [2024-10-14 14:01:37,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 405 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2024-10-14 14:01:37,331 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 703 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:37,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 466 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 14:01:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-14 14:01:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 252. [2024-10-14 14:01:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 217 states have (on average 1.423963133640553) internal successors, (309), 218 states have internal predecessors, (309), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 14:01:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2024-10-14 14:01:37,352 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 182 [2024-10-14 14:01:37,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:37,352 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2024-10-14 14:01:37,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.071428571428571) internal successors, (85), 16 states have internal predecessors, (85), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2024-10-14 14:01:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2024-10-14 14:01:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-14 14:01:37,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:37,355 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:37,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 14:01:37,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 14:01:37,560 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:37,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash 825561936, now seen corresponding path program 1 times [2024-10-14 14:01:37,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:01:37,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717582728] [2024-10-14 14:01:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:37,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:01:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:01:37,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 14:01:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:01:37,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 14:01:37,866 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 14:01:37,867 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 14:01:37,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:01:37,872 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:37,943 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 14:01:37,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:01:37 BoogieIcfgContainer [2024-10-14 14:01:37,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 14:01:37,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 14:01:37,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 14:01:37,948 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 14:01:37,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:01:27" (3/4) ... [2024-10-14 14:01:37,952 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 14:01:37,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 14:01:37,954 INFO L158 Benchmark]: Toolchain (without parser) took 11610.32ms. Allocated memory was 174.1MB in the beginning and 316.7MB in the end (delta: 142.6MB). Free memory was 146.3MB in the beginning and 218.8MB in the end (delta: -72.5MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2024-10-14 14:01:37,954 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:01:37,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.95ms. Allocated memory is still 174.1MB. Free memory was 146.1MB in the beginning and 124.8MB in the end (delta: 21.3MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-10-14 14:01:37,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.68ms. Allocated memory is still 174.1MB. Free memory was 124.8MB in the beginning and 118.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 14:01:37,955 INFO L158 Benchmark]: Boogie Preprocessor took 158.59ms. Allocated memory is still 174.1MB. Free memory was 118.5MB in the beginning and 111.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 14:01:37,956 INFO L158 Benchmark]: RCFGBuilder took 894.64ms. Allocated memory is still 174.1MB. Free memory was 111.2MB in the beginning and 57.7MB in the end (delta: 53.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-10-14 14:01:37,956 INFO L158 Benchmark]: TraceAbstraction took 10011.15ms. Allocated memory was 174.1MB in the beginning and 316.7MB in the end (delta: 142.6MB). Free memory was 57.7MB in the beginning and 218.8MB in the end (delta: -161.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:01:37,956 INFO L158 Benchmark]: Witness Printer took 5.40ms. Allocated memory is still 316.7MB. Free memory is still 218.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:01:37,957 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.15ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.95ms. Allocated memory is still 174.1MB. Free memory was 146.1MB in the beginning and 124.8MB in the end (delta: 21.3MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.68ms. Allocated memory is still 174.1MB. Free memory was 124.8MB in the beginning and 118.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 158.59ms. Allocated memory is still 174.1MB. Free memory was 118.5MB in the beginning and 111.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 894.64ms. Allocated memory is still 174.1MB. Free memory was 111.2MB in the beginning and 57.7MB in the end (delta: 53.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10011.15ms. Allocated memory was 174.1MB in the beginning and 316.7MB in the end (delta: 142.6MB). Free memory was 57.7MB in the beginning and 218.8MB in the end (delta: -161.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.40ms. Allocated memory is still 316.7MB. Free memory is still 218.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of shiftLeft at line 79, overapproximation of someBinaryArithmeticFLOAToperation at line 73. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] FCALL updateLastVariables() [L138] CALL updateVariables() [L87] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] 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] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_short() [L91] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 16383) 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_3 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 8192) 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_4 <= 8192) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L97] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 8191) 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_5 <= 8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_6 = __VERIFIER_nondet_short() [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) 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_6 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_8 [L103] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_8 [L103] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L103] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 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] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L105] EXPR WrapperStruct00.var_1_9 [L105] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_9 [L105] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 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] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_10 [L107] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_10 [L107] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 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] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) 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_12 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ushort() [L112] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 32767) 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 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ushort() [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ushort() [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L121] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L124] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L125] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] RET updateVariables() [L139] CALL step() [L66] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L66] COND FALSE !(! WrapperStruct00.var_1_2) [L69] EXPR WrapperStruct00.var_1_5 [L69] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_5 [L71] EXPR WrapperStruct00.var_1_5 [L71] signed short int stepLocal_0 = WrapperStruct00.var_1_5; [L72] COND TRUE stepLocal_0 > 2 [L73] EXPR WrapperStruct00.var_1_8 [L73] EXPR WrapperStruct00.var_1_9 [L73] EXPR WrapperStruct00.var_1_10 [L73] WrapperStruct00.var_1_7 = ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10) [L75] EXPR WrapperStruct00.var_1_17 [L75] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_17 [L76] EXPR WrapperStruct00.var_1_2 [L76] WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L76] WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12 [L76] EXPR WrapperStruct00.var_1_12 [L76] WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L76] COND FALSE !(WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) [L79] EXPR WrapperStruct00.var_1_3 [L79] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] EXPR -25 << WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] COND FALSE !(WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) [L82] EXPR WrapperStruct00.var_1_17 [L82] EXPR WrapperStruct00.var_1_15 [L82] WrapperStruct00.var_1_11 = (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR (! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) [L130] EXPR WrapperStruct00.var_1_1 [L130] EXPR WrapperStruct00.var_1_5 [L130] EXPR (! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1) [L130] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR (WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1 [L130] EXPR WrapperStruct00.var_1_7 [L130] EXPR WrapperStruct00.var_1_8 [L130] EXPR WrapperStruct00.var_1_9 [L130] EXPR WrapperStruct00.var_1_10 [L130] EXPR (WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR (((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1)) && ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_13 + ((((((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) < (WrapperStruct00.var_1_16)) ? (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_16)))))) : ((WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_11 == ((unsigned short int) ((((((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) < 0 ) ? -(((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) : (((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))))))) : (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR (((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1)) && ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_13 + ((((((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) < (WrapperStruct00.var_1_16)) ? (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_16)))))) : ((WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_11 == ((unsigned short int) ((((((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) < 0 ) ? -(((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) : (((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))))))) : (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1)) && ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_13 + ((((((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) < (WrapperStruct00.var_1_16)) ? (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_16)))))) : ((WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_11 == ((unsigned short int) ((((((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) < 0 ) ? -(((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) : (((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))))))) : (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1)) && ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_13 + ((((((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) < (WrapperStruct00.var_1_16)) ? (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_16)))))) : ((WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_11 == ((unsigned short int) ((((((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) < 0 ) ? -(((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) : (((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))))))) : (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1] [L130-L131] return ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1)) && ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_13 + ((((((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) < (WrapperStruct00.var_1_16)) ? (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_16)))))) : ((WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_11 == ((unsigned short int) ((((((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) < 0 ) ? -(((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) : (((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))))))) : (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_17)) ; [L140] RET, EXPR property() [L140] 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, 152 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 948 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 941 mSDsluCounter, 3163 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2118 mSDsCounter, 251 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2219 IncrementalHoareTripleChecker+Invalid, 2470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 251 mSolverCounterUnsat, 1045 mSDtfsCounter, 2219 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 754 GetRequests, 709 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1449 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1440 ConstructedInterpolants, 0 QuantifiedInterpolants, 2568 SizeOfPredicates, 6 NumberOfNonLiveVariables, 568 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 9591/9600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 14:01:38,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2633f484e0865e6e431657ee89a0a14b8fb20a20b6a1493f613e45a885039ef4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:01:40,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:01:40,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 14:01:40,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:01:40,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:01:40,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:01:40,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:01:40,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:01:40,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:01:40,394 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:01:40,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:01:40,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:01:40,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:01:40,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:01:40,398 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:01:40,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:01:40,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:01:40,398 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:01:40,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:01:40,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:01:40,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:01:40,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:01:40,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:01:40,403 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 14:01:40,403 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 14:01:40,404 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:01:40,404 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 14:01:40,404 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:01:40,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:01:40,405 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:01:40,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:01:40,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:01:40,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:01:40,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:01:40,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:01:40,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:01:40,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:01:40,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:01:40,408 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 14:01:40,408 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 14:01:40,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:01:40,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:01:40,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:01:40,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:01:40,410 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 14:01:40,410 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2633f484e0865e6e431657ee89a0a14b8fb20a20b6a1493f613e45a885039ef4 [2024-10-14 14:01:40,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:01:40,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:01:40,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:01:40,769 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:01:40,770 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:01:40,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i [2024-10-14 14:01:42,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:01:42,478 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:01:42,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i [2024-10-14 14:01:42,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e9182f09/20900ef23a684391a010b9593d6aff24/FLAGf58a4de2a [2024-10-14 14:01:42,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e9182f09/20900ef23a684391a010b9593d6aff24 [2024-10-14 14:01:42,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:01:42,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:01:42,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:01:42,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:01:42,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:01:42,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:42,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73211857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42, skipping insertion in model container [2024-10-14 14:01:42,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:42,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:01:42,726 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-86.i[916,929] [2024-10-14 14:01:42,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:01:42,859 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:01:42,871 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-86.i[916,929] [2024-10-14 14:01:42,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:01:42,979 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:01:42,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42 WrapperNode [2024-10-14 14:01:42,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:01:42,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:01:42,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:01:42,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:01:42,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:43,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:43,072 INFO L138 Inliner]: procedures = 36, calls = 243, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 744 [2024-10-14 14:01:43,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:01:43,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:01:43,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:01:43,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:01:43,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:43,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:43,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:43,131 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 18]. The 21 writes are split as follows [0, 21]. [2024-10-14 14:01:43,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:43,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:43,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:43,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:43,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:43,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:43,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:01:43,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:01:43,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:01:43,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:01:43,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (1/1) ... [2024-10-14 14:01:43,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:01:43,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:01:43,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:01:43,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:01:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:01:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 14:01:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 14:01:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-14 14:01:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-14 14:01:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 14:01:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 14:01:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 14:01:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 14:01:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 14:01:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 14:01:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 14:01:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 14:01:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-14 14:01:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-14 14:01:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 14:01:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 14:01:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-14 14:01:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-14 14:01:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:01:43,309 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:01:43,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:01:43,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:01:43,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 14:01:43,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 14:01:43,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-14 14:01:43,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-14 14:01:43,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 14:01:43,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 14:01:43,497 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:01:43,499 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:01:44,561 INFO L? ?]: Removed 247 outVars from TransFormulas that were not future-live. [2024-10-14 14:01:44,562 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:01:44,598 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:01:44,599 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:01:44,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:01:44 BoogieIcfgContainer [2024-10-14 14:01:44,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:01:44,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:01:44,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:01:44,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:01:44,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:01:42" (1/3) ... [2024-10-14 14:01:44,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0830ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:01:44, skipping insertion in model container [2024-10-14 14:01:44,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:01:42" (2/3) ... [2024-10-14 14:01:44,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0830ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:01:44, skipping insertion in model container [2024-10-14 14:01:44,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:01:44" (3/3) ... [2024-10-14 14:01:44,609 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-86.i [2024-10-14 14:01:44,626 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:01:44,626 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:01:44,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:01:44,704 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;@22a0bea8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:01:44,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:01:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 121 states have internal predecessors, (175), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 14:01:44,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:44,727 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:44,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:44,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 646539576, now seen corresponding path program 1 times [2024-10-14 14:01:44,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:44,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403711509] [2024-10-14 14:01:44,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:44,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:44,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:44,751 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:01:44,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 14:01:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:45,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 14:01:45,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2024-10-14 14:01:45,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:45,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:45,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403711509] [2024-10-14 14:01:45,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403711509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:45,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:45,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:01:45,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234919043] [2024-10-14 14:01:45,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:45,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:01:45,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:45,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:01:45,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:01:45,259 INFO L87 Difference]: Start difference. First operand has 148 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 121 states have internal predecessors, (175), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:45,328 INFO L93 Difference]: Finished difference Result 293 states and 473 transitions. [2024-10-14 14:01:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:01:45,330 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 179 [2024-10-14 14:01:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:45,338 INFO L225 Difference]: With dead ends: 293 [2024-10-14 14:01:45,338 INFO L226 Difference]: Without dead ends: 146 [2024-10-14 14:01:45,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:01:45,345 INFO L432 NwaCegarLoop]: 216 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, 216 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:45,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:01:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-14 14:01:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-10-14 14:01:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2024-10-14 14:01:45,413 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 179 [2024-10-14 14:01:45,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:45,413 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2024-10-14 14:01:45,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-10-14 14:01:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 14:01:45,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:45,425 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:45,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 14:01:45,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:45,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:45,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:45,627 INFO L85 PathProgramCache]: Analyzing trace with hash 733936946, now seen corresponding path program 1 times [2024-10-14 14:01:45,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:45,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679555792] [2024-10-14 14:01:45,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:45,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:45,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:45,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:01:45,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 14:01:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:45,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 14:01:46,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-10-14 14:01:46,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:46,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:46,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679555792] [2024-10-14 14:01:46,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679555792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:46,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:46,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:01:46,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653737319] [2024-10-14 14:01:46,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:46,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:01:46,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:46,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:01:46,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:46,085 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:46,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:46,168 INFO L93 Difference]: Finished difference Result 293 states and 442 transitions. [2024-10-14 14:01:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:01:46,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 179 [2024-10-14 14:01:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:46,171 INFO L225 Difference]: With dead ends: 293 [2024-10-14 14:01:46,171 INFO L226 Difference]: Without dead ends: 148 [2024-10-14 14:01:46,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:01:46,174 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 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-14 14:01:46,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:01:46,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-14 14:01:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-10-14 14:01:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 121 states have (on average 1.421487603305785) internal successors, (172), 121 states have internal predecessors, (172), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2024-10-14 14:01:46,199 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 179 [2024-10-14 14:01:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:46,200 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2024-10-14 14:01:46,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2024-10-14 14:01:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 14:01:46,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:46,206 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:46,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 14:01:46,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:46,408 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:46,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1839027664, now seen corresponding path program 1 times [2024-10-14 14:01:46,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:46,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285841293] [2024-10-14 14:01:46,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:46,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:46,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:46,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:01:46,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 14:01:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:46,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 14:01:46,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-14 14:01:46,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:46,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:46,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285841293] [2024-10-14 14:01:46,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285841293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:46,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:46,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:01:46,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401257859] [2024-10-14 14:01:46,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:46,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:01:46,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:46,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:01:46,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:01:46,825 INFO L87 Difference]: Start difference. First operand 148 states and 222 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 14:01:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:46,907 INFO L93 Difference]: Finished difference Result 300 states and 450 transitions. [2024-10-14 14:01:46,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:01:46,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 179 [2024-10-14 14:01:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:46,911 INFO L225 Difference]: With dead ends: 300 [2024-10-14 14:01:46,912 INFO L226 Difference]: Without dead ends: 153 [2024-10-14 14:01:46,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:01:46,916 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:46,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 838 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:01:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-14 14:01:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2024-10-14 14:01:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 125 states have (on average 1.408) internal successors, (176), 125 states have internal predecessors, (176), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 226 transitions. [2024-10-14 14:01:46,930 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 226 transitions. Word has length 179 [2024-10-14 14:01:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:46,932 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 226 transitions. [2024-10-14 14:01:46,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 14:01:46,932 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2024-10-14 14:01:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 14:01:46,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:46,935 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:46,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 14:01:47,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:47,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:47,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:47,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1838968082, now seen corresponding path program 1 times [2024-10-14 14:01:47,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:47,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071775598] [2024-10-14 14:01:47,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:47,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:47,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:47,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:01:47,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 14:01:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:47,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 14:01:47,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:47,658 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 95 treesize of output 41 [2024-10-14 14:01:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-10-14 14:01:47,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:47,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:47,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071775598] [2024-10-14 14:01:47,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071775598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:47,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:47,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:01:47,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918222628] [2024-10-14 14:01:47,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:47,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:01:47,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:47,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:01:47,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:47,709 INFO L87 Difference]: Start difference. First operand 152 states and 226 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:48,727 INFO L93 Difference]: Finished difference Result 303 states and 451 transitions. [2024-10-14 14:01:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:01:48,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 179 [2024-10-14 14:01:48,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:48,730 INFO L225 Difference]: With dead ends: 303 [2024-10-14 14:01:48,730 INFO L226 Difference]: Without dead ends: 152 [2024-10-14 14:01:48,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:01:48,732 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 186 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:48,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 649 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 14:01:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-14 14:01:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2024-10-14 14:01:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 123 states have internal predecessors, (173), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 223 transitions. [2024-10-14 14:01:48,752 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 223 transitions. Word has length 179 [2024-10-14 14:01:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:48,753 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 223 transitions. [2024-10-14 14:01:48,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 223 transitions. [2024-10-14 14:01:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-14 14:01:48,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:48,756 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:48,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 14:01:48,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:48,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:48,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1333681526, now seen corresponding path program 1 times [2024-10-14 14:01:48,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:48,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020145466] [2024-10-14 14:01:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:48,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:48,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:48,962 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:01:48,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 14:01:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:49,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 14:01:49,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:49,485 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 94 treesize of output 40 [2024-10-14 14:01:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 616 proven. 40 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-14 14:01:49,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:01:49,749 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 58 treesize of output 22 [2024-10-14 14:01:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-14 14:01:49,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020145466] [2024-10-14 14:01:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020145466] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:01:49,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 14:01:49,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-14 14:01:49,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92311800] [2024-10-14 14:01:49,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 14:01:49,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 14:01:49,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:49,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 14:01:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-14 14:01:49,787 INFO L87 Difference]: Start difference. First operand 150 states and 223 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2024-10-14 14:01:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:51,497 INFO L93 Difference]: Finished difference Result 312 states and 460 transitions. [2024-10-14 14:01:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 14:01:51,498 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) Word has length 181 [2024-10-14 14:01:51,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:51,499 INFO L225 Difference]: With dead ends: 312 [2024-10-14 14:01:51,499 INFO L226 Difference]: Without dead ends: 152 [2024-10-14 14:01:51,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-14 14:01:51,501 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 185 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:51,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1065 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 14:01:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-14 14:01:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2024-10-14 14:01:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 123 states have (on average 1.3902439024390243) internal successors, (171), 123 states have internal predecessors, (171), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 221 transitions. [2024-10-14 14:01:51,520 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 221 transitions. Word has length 181 [2024-10-14 14:01:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:51,524 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 221 transitions. [2024-10-14 14:01:51,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2024-10-14 14:01:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 221 transitions. [2024-10-14 14:01:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-14 14:01:51,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:51,526 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:51,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 14:01:51,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:51,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:51,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1679113484, now seen corresponding path program 1 times [2024-10-14 14:01:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:51,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287257175] [2024-10-14 14:01:51,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:51,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:51,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:51,733 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:01:51,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 14:01:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:52,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 14:01:52,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:52,282 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 95 treesize of output 41 [2024-10-14 14:01:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2024-10-14 14:01:52,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:52,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287257175] [2024-10-14 14:01:52,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287257175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:52,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:52,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:01:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158270238] [2024-10-14 14:01:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:52,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:01:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:52,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:01:52,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:52,315 INFO L87 Difference]: Start difference. First operand 150 states and 221 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:53,089 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2024-10-14 14:01:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:01:53,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 181 [2024-10-14 14:01:53,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:53,092 INFO L225 Difference]: With dead ends: 300 [2024-10-14 14:01:53,092 INFO L226 Difference]: Without dead ends: 151 [2024-10-14 14:01:53,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:01:53,093 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 173 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:53,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 637 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 14:01:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-14 14:01:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2024-10-14 14:01:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2024-10-14 14:01:53,101 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 181 [2024-10-14 14:01:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:53,102 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2024-10-14 14:01:53,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2024-10-14 14:01:53,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-14 14:01:53,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:53,104 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:53,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 14:01:53,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:53,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:53,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1178545106, now seen corresponding path program 1 times [2024-10-14 14:01:53,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:53,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891693725] [2024-10-14 14:01:53,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:53,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:53,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:53,307 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:01:53,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 14:01:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:53,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 14:01:53,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:53,780 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 95 treesize of output 41 [2024-10-14 14:01:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-14 14:01:53,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:01:53,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891693725] [2024-10-14 14:01:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891693725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:01:53,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:01:53,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:01:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056446041] [2024-10-14 14:01:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:53,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:01:53,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:53,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:01:53,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:01:53,806 INFO L87 Difference]: Start difference. First operand 150 states and 220 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:54,590 INFO L93 Difference]: Finished difference Result 300 states and 440 transitions. [2024-10-14 14:01:54,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:01:54,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 183 [2024-10-14 14:01:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:54,591 INFO L225 Difference]: With dead ends: 300 [2024-10-14 14:01:54,591 INFO L226 Difference]: Without dead ends: 151 [2024-10-14 14:01:54,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:01:54,593 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 165 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:54,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 633 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 14:01:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-14 14:01:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2024-10-14 14:01:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 123 states have (on average 1.3739837398373984) internal successors, (169), 123 states have internal predecessors, (169), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 219 transitions. [2024-10-14 14:01:54,599 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 219 transitions. Word has length 183 [2024-10-14 14:01:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:54,600 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 219 transitions. [2024-10-14 14:01:54,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 14:01:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 219 transitions. [2024-10-14 14:01:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-14 14:01:54,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:54,602 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:54,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 14:01:54,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:54,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:54,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:54,804 INFO L85 PathProgramCache]: Analyzing trace with hash -90933708, now seen corresponding path program 1 times [2024-10-14 14:01:54,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:54,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882072863] [2024-10-14 14:01:54,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:54,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:54,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:54,806 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:01:54,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 14:01:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:01:55,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-14 14:01:55,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:01:55,306 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-14 14:01:55,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-14 14:01:55,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-14 14:01:55,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:55,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-14 14:01:55,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:55,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-14 14:01:55,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:55,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-14 14:01:55,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:55,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-14 14:01:55,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:55,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-14 14:01:56,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:56,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-14 14:01:56,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:56,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-14 14:01:56,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:56,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2024-10-14 14:01:56,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:56,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2024-10-14 14:01:56,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:56,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 67 [2024-10-14 14:01:57,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:57,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 77 [2024-10-14 14:01:57,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:57,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 85 [2024-10-14 14:01:57,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:01:57,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 85 [2024-10-14 14:01:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 926 proven. 69 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-10-14 14:01:57,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:01:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-14 14:01:58,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:01:58,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882072863] [2024-10-14 14:01:58,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882072863] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 14:01:58,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 14:01:58,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16 [2024-10-14 14:01:58,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864910619] [2024-10-14 14:01:58,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:01:58,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:01:58,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:01:58,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:01:58,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-10-14 14:01:58,031 INFO L87 Difference]: Start difference. First operand 150 states and 219 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 14:01:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:01:59,481 INFO L93 Difference]: Finished difference Result 376 states and 553 transitions. [2024-10-14 14:01:59,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:01:59,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2024-10-14 14:01:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:01:59,483 INFO L225 Difference]: With dead ends: 376 [2024-10-14 14:01:59,483 INFO L226 Difference]: Without dead ends: 227 [2024-10-14 14:01:59,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-10-14 14:01:59,484 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 104 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:01:59,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 451 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 14:01:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-14 14:01:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 154. [2024-10-14 14:01:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-14 14:01:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2024-10-14 14:01:59,494 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 185 [2024-10-14 14:01:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:01:59,495 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2024-10-14 14:01:59,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 14:01:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2024-10-14 14:01:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-14 14:01:59,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:01:59,499 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:01:59,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 14:01:59,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:59,700 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:01:59,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:01:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash 920183542, now seen corresponding path program 1 times [2024-10-14 14:01:59,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:01:59,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489803665] [2024-10-14 14:01:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:01:59,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:01:59,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:01:59,703 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:01:59,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 14:02:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:00,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-14 14:02:00,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:00,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 14:02:00,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-14 14:02:00,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:00,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-14 14:02:00,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:00,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-14 14:02:00,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:00,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-10-14 14:02:00,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:00,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2024-10-14 14:02:00,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:00,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-10-14 14:02:00,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:00,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2024-10-14 14:02:01,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:01,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 77 [2024-10-14 14:02:01,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:01,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2024-10-14 14:02:01,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:01,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2024-10-14 14:02:01,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:01,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 89 [2024-10-14 14:02:02,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:02,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 97 [2024-10-14 14:02:02,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:02,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 109 treesize of output 117 [2024-10-14 14:02:02,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:02,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 139 treesize of output 138 [2024-10-14 14:02:02,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:02,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 179 treesize of output 77 [2024-10-14 14:02:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 946 proven. 51 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-10-14 14:02:02,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:02:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-14 14:02:02,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:02,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489803665] [2024-10-14 14:02:02,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489803665] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 14:02:02,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 14:02:02,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 22 [2024-10-14 14:02:02,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674179305] [2024-10-14 14:02:02,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:02,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:02:02,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:02,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:02:02,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2024-10-14 14:02:02,927 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 14:02:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:04,341 INFO L93 Difference]: Finished difference Result 415 states and 603 transitions. [2024-10-14 14:02:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:02:04,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2024-10-14 14:02:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:04,343 INFO L225 Difference]: With dead ends: 415 [2024-10-14 14:02:04,343 INFO L226 Difference]: Without dead ends: 262 [2024-10-14 14:02:04,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2024-10-14 14:02:04,345 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 249 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:04,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 596 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 14:02:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-14 14:02:04,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 242. [2024-10-14 14:02:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 208 states have (on average 1.4086538461538463) internal successors, (293), 209 states have internal predecessors, (293), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 14:02:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 355 transitions. [2024-10-14 14:02:04,361 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 355 transitions. Word has length 185 [2024-10-14 14:02:04,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:04,361 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 355 transitions. [2024-10-14 14:02:04,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-14 14:02:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 355 transitions. [2024-10-14 14:02:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-14 14:02:04,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:04,364 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:04,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 14:02:04,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:04,564 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:04,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash -90726533, now seen corresponding path program 1 times [2024-10-14 14:02:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:04,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301551074] [2024-10-14 14:02:04,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:04,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:04,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:04,568 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:02:04,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process