./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-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.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 a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:45:16,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:45:16,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:45:16,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:45:16,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:45:16,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:45:16,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:45:16,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:45:16,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:45:16,621 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:45:16,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:45:16,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:45:16,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:45:16,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:45:16,623 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:45:16,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:45:16,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:45:16,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:45:16,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:45:16,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:45:16,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:45:16,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:45:16,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:45:16,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:45:16,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:45:16,628 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:45:16,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:45:16,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:45:16,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:45:16,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:45:16,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:45:16,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:45:16,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:45:16,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:45:16,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:45:16,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:45:16,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:45:16,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:45:16,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:45:16,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:45:16,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:45:16,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:45:16,631 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 -> a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 [2024-10-24 11:45:16,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:45:16,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:45:16,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:45:16,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:45:16,846 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:45:16,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i [2024-10-24 11:45:18,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:45:18,239 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:45:18,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i [2024-10-24 11:45:18,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4936f6641/edf978b7439a46d48c17686d2562cd3e/FLAG1c2b042e6 [2024-10-24 11:45:18,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4936f6641/edf978b7439a46d48c17686d2562cd3e [2024-10-24 11:45:18,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:45:18,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:45:18,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:45:18,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:45:18,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:45:18,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:18,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@336a8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18, skipping insertion in model container [2024-10-24 11:45:18,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:18,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:45:18,793 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i[916,929] [2024-10-24 11:45:18,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:45:18,859 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:45:18,868 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-17.i[916,929] [2024-10-24 11:45:18,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:45:18,939 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:45:18,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18 WrapperNode [2024-10-24 11:45:18,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:45:18,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:45:18,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:45:18,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:45:18,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:18,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:18,998 INFO L138 Inliner]: procedures = 29, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 616 [2024-10-24 11:45:18,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:45:18,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:45:19,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:45:19,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:45:19,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:19,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:19,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:19,038 INFO L175 MemorySlicer]: Split 156 memory accesses to 2 slices as follows [2, 154]. 99 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 19 writes are split as follows [0, 19]. [2024-10-24 11:45:19,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:19,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:19,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:19,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:19,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:19,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:19,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:45:19,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:45:19,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:45:19,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:45:19,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (1/1) ... [2024-10-24 11:45:19,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:45:19,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:45:19,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:45:19,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:45:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:45:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:45:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:45:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:45:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:45:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:45:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:45:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:45:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:45:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:45:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:45:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:45:19,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:45:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:45:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:45:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:45:19,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:45:19,255 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:45:19,256 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:45:19,664 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2024-10-24 11:45:19,665 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:45:19,692 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:45:19,693 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:45:19,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:19 BoogieIcfgContainer [2024-10-24 11:45:19,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:45:19,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:45:19,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:45:19,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:45:19,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:45:18" (1/3) ... [2024-10-24 11:45:19,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388f5e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:19, skipping insertion in model container [2024-10-24 11:45:19,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:18" (2/3) ... [2024-10-24 11:45:19,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388f5e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:19, skipping insertion in model container [2024-10-24 11:45:19,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:19" (3/3) ... [2024-10-24 11:45:19,702 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-17.i [2024-10-24 11:45:19,713 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:45:19,713 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:45:19,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:45:19,768 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;@14409af3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:45:19,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:45:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:45:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:45:19,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:19,785 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:19,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:19,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:19,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1736269305, now seen corresponding path program 1 times [2024-10-24 11:45:19,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:19,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104646725] [2024-10-24 11:45:19,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:19,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:45:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:45:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:45:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:45:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:45:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:45:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:45:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:20,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:20,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104646725] [2024-10-24 11:45:20,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104646725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:20,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:20,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:45:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814039743] [2024-10-24 11:45:20,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:20,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:45:20,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:20,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:45:20,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:45:20,190 INFO L87 Difference]: Start difference. First operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:20,235 INFO L93 Difference]: Finished difference Result 271 states and 428 transitions. [2024-10-24 11:45:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:45:20,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-24 11:45:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:20,247 INFO L225 Difference]: With dead ends: 271 [2024-10-24 11:45:20,247 INFO L226 Difference]: Without dead ends: 135 [2024-10-24 11:45:20,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:45:20,254 INFO L432 NwaCegarLoop]: 198 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, 198 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:20,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-24 11:45:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-24 11:45:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.452991452991453) internal successors, (170), 117 states have internal predecessors, (170), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:45:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2024-10-24 11:45:20,293 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 136 [2024-10-24 11:45:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:20,294 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2024-10-24 11:45:20,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2024-10-24 11:45:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:45:20,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:20,297 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:20,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:45:20,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:20,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash 194679485, now seen corresponding path program 1 times [2024-10-24 11:45:20,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:20,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258115481] [2024-10-24 11:45:20,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:20,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:45:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:45:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:45:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:45:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:45:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:45:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:45:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:20,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:20,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258115481] [2024-10-24 11:45:20,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258115481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:20,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:20,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:45:20,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879213119] [2024-10-24 11:45:20,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:20,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:45:20,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:45:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:20,559 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:20,603 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2024-10-24 11:45:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:45:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-24 11:45:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:20,606 INFO L225 Difference]: With dead ends: 271 [2024-10-24 11:45:20,608 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 11:45:20,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:20,609 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:20,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 11:45:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-24 11:45:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:45:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2024-10-24 11:45:20,622 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 136 [2024-10-24 11:45:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:20,626 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2024-10-24 11:45:20,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2024-10-24 11:45:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:45:20,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:20,629 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:20,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:45:20,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:20,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2049878913, now seen corresponding path program 1 times [2024-10-24 11:45:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:20,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410948246] [2024-10-24 11:45:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:20,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:45:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:45:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:45:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:45:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:45:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:45:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:45:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:20,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:20,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410948246] [2024-10-24 11:45:20,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410948246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:20,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:20,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:45:20,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538952065] [2024-10-24 11:45:20,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:20,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:45:20,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:20,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:45:20,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:20,858 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:45:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:20,891 INFO L93 Difference]: Finished difference Result 275 states and 410 transitions. [2024-10-24 11:45:20,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:45:20,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-10-24 11:45:20,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:20,896 INFO L225 Difference]: With dead ends: 275 [2024-10-24 11:45:20,896 INFO L226 Difference]: Without dead ends: 139 [2024-10-24 11:45:20,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:20,898 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:20,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-24 11:45:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-10-24 11:45:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:45:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2024-10-24 11:45:20,909 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 206 transitions. Word has length 136 [2024-10-24 11:45:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:20,910 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 206 transitions. [2024-10-24 11:45:20,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:45:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2024-10-24 11:45:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:45:20,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:20,911 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:20,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:45:20,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:20,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash 776557572, now seen corresponding path program 1 times [2024-10-24 11:45:20,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:20,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241265329] [2024-10-24 11:45:20,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:20,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:45:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:45:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:45:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:45:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:45:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:45:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:45:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:21,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:21,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241265329] [2024-10-24 11:45:21,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241265329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:21,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:21,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:45:21,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958125799] [2024-10-24 11:45:21,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:21,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:45:21,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:45:21,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:45:21,457 INFO L87 Difference]: Start difference. First operand 139 states and 206 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:45:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:21,652 INFO L93 Difference]: Finished difference Result 280 states and 415 transitions. [2024-10-24 11:45:21,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:45:21,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-24 11:45:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:21,654 INFO L225 Difference]: With dead ends: 280 [2024-10-24 11:45:21,654 INFO L226 Difference]: Without dead ends: 142 [2024-10-24 11:45:21,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-24 11:45:21,655 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 83 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:21,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 477 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:45:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-24 11:45:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2024-10-24 11:45:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 123 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:45:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2024-10-24 11:45:21,662 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 138 [2024-10-24 11:45:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:21,662 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2024-10-24 11:45:21,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:45:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2024-10-24 11:45:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:45:21,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:21,664 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:21,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:45:21,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:21,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash -32789054, now seen corresponding path program 1 times [2024-10-24 11:45:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:21,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974784153] [2024-10-24 11:45:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:45:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:22,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:45:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:45:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:45:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:45:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:45:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:45:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:23,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:23,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974784153] [2024-10-24 11:45:23,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974784153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:23,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:45:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477719908] [2024-10-24 11:45:23,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:23,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:45:23,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:23,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:45:23,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:45:23,031 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:45:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:23,615 INFO L93 Difference]: Finished difference Result 564 states and 833 transitions. [2024-10-24 11:45:23,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:45:23,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-24 11:45:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:23,618 INFO L225 Difference]: With dead ends: 564 [2024-10-24 11:45:23,618 INFO L226 Difference]: Without dead ends: 424 [2024-10-24 11:45:23,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:45:23,621 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 318 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:23,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 908 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:45:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-24 11:45:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 418. [2024-10-24 11:45:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 366 states have (on average 1.4289617486338797) internal successors, (523), 366 states have internal predecessors, (523), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 11:45:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 619 transitions. [2024-10-24 11:45:23,653 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 619 transitions. Word has length 138 [2024-10-24 11:45:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:23,654 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 619 transitions. [2024-10-24 11:45:23,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:45:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 619 transitions. [2024-10-24 11:45:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:45:23,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:23,657 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:23,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:45:23,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:23,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash -830304446, now seen corresponding path program 1 times [2024-10-24 11:45:23,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:23,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516445057] [2024-10-24 11:45:23,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:23,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:45:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:45:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:45:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:45:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:45:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:45:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:45:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:24,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:24,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516445057] [2024-10-24 11:45:24,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516445057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:24,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:24,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:45:24,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103849616] [2024-10-24 11:45:24,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:24,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:45:24,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:24,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:45:24,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:24,452 INFO L87 Difference]: Start difference. First operand 418 states and 619 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:24,718 INFO L93 Difference]: Finished difference Result 1020 states and 1508 transitions. [2024-10-24 11:45:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:45:24,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2024-10-24 11:45:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:24,721 INFO L225 Difference]: With dead ends: 1020 [2024-10-24 11:45:24,721 INFO L226 Difference]: Without dead ends: 603 [2024-10-24 11:45:24,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 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-24 11:45:24,724 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 79 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:24,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 604 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:45:24,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-24 11:45:24,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 481. [2024-10-24 11:45:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 429 states have (on average 1.442890442890443) internal successors, (619), 429 states have internal predecessors, (619), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 11:45:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 715 transitions. [2024-10-24 11:45:24,748 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 715 transitions. Word has length 138 [2024-10-24 11:45:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:24,749 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 715 transitions. [2024-10-24 11:45:24,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 715 transitions. [2024-10-24 11:45:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 11:45:24,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:24,750 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:24,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:45:24,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:24,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1267571441, now seen corresponding path program 1 times [2024-10-24 11:45:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:24,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469866331] [2024-10-24 11:45:24,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:45:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:45:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:45:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:45:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:45:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:45:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:45:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:45:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:45:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:45:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:45:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:45:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 11:45:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:25,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:25,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469866331] [2024-10-24 11:45:25,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469866331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:25,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:25,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:45:25,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049653438] [2024-10-24 11:45:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:25,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:45:25,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:25,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:45:25,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:45:25,143 INFO L87 Difference]: Start difference. First operand 481 states and 715 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:45:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:25,576 INFO L93 Difference]: Finished difference Result 806 states and 1197 transitions. [2024-10-24 11:45:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:45:25,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-10-24 11:45:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:25,579 INFO L225 Difference]: With dead ends: 806 [2024-10-24 11:45:25,579 INFO L226 Difference]: Without dead ends: 645 [2024-10-24 11:45:25,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:45:25,580 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 323 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:25,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 805 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:45:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-24 11:45:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 324. [2024-10-24 11:45:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 289 states have (on average 1.4429065743944636) internal successors, (417), 289 states have internal predecessors, (417), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 11:45:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 481 transitions. [2024-10-24 11:45:25,596 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 481 transitions. Word has length 139 [2024-10-24 11:45:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:25,597 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 481 transitions. [2024-10-24 11:45:25,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:45:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 481 transitions. [2024-10-24 11:45:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 11:45:25,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:25,598 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:25,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:45:25,599 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:25,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:25,599 INFO L85 PathProgramCache]: Analyzing trace with hash 433249426, now seen corresponding path program 1 times [2024-10-24 11:45:25,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:25,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235298628] [2024-10-24 11:45:25,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:25,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:45:25,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:45:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:45:25,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:45:25,725 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:45:25,725 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:45:25,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:45:25,728 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:25,797 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:45:25,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:45:25 BoogieIcfgContainer [2024-10-24 11:45:25,799 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:45:25,800 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:45:25,800 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:45:25,800 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:45:25,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:19" (3/4) ... [2024-10-24 11:45:25,801 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:45:25,802 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:45:25,803 INFO L158 Benchmark]: Toolchain (without parser) took 7164.02ms. Allocated memory was 134.2MB in the beginning and 327.2MB in the end (delta: 192.9MB). Free memory was 64.7MB in the beginning and 194.5MB in the end (delta: -129.8MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2024-10-24 11:45:25,803 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:45:25,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.54ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 64.4MB in the beginning and 149.0MB in the end (delta: -84.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 11:45:25,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.98ms. Allocated memory is still 180.4MB. Free memory was 149.0MB in the beginning and 144.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:45:25,804 INFO L158 Benchmark]: Boogie Preprocessor took 76.47ms. Allocated memory is still 180.4MB. Free memory was 144.8MB in the beginning and 139.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:45:25,804 INFO L158 Benchmark]: RCFGBuilder took 617.74ms. Allocated memory is still 180.4MB. Free memory was 138.5MB in the beginning and 97.6MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-24 11:45:25,804 INFO L158 Benchmark]: TraceAbstraction took 6103.67ms. Allocated memory was 180.4MB in the beginning and 327.2MB in the end (delta: 146.8MB). Free memory was 96.5MB in the beginning and 195.5MB in the end (delta: -99.0MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2024-10-24 11:45:25,804 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 327.2MB. Free memory was 195.5MB in the beginning and 194.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:45:25,805 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.12ms. Allocated memory is still 134.2MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.54ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 64.4MB in the beginning and 149.0MB in the end (delta: -84.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.98ms. Allocated memory is still 180.4MB. Free memory was 149.0MB in the beginning and 144.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.47ms. Allocated memory is still 180.4MB. Free memory was 144.8MB in the beginning and 139.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 617.74ms. Allocated memory is still 180.4MB. Free memory was 138.5MB in the beginning and 97.6MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6103.67ms. Allocated memory was 180.4MB in the beginning and 327.2MB in the end (delta: 146.8MB). Free memory was 96.5MB in the beginning and 195.5MB in the end (delta: -99.0MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 327.2MB. Free memory was 195.5MB in the beginning and 194.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L59] unsigned char last_1_WrapperStruct00_var_1_15 = 16; [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L121] EXPR WrapperStruct00.var_1_15 [L121] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L92] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L94] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L95] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct00.var_1_3 [L96] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_3 [L96] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] EXPR (WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] EXPR (WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_4 [L98] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_4 [L98] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] EXPR (WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] EXPR (WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_5 [L100] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_5 [L100] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] EXPR (WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] EXPR (WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L101] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_7 [L102] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_7 [L102] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L103] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L105] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L108] WrapperStruct00.var_1_10 = __VERIFIER_nondet_short() [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L111] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L115] EXPR WrapperStruct00.var_1_14 [L115] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_14 [L115] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L132] RET updateVariables() [L133] CALL step() [L63] WrapperStruct00.var_1_12 = last_1_WrapperStruct00_var_1_15 [L64] EXPR WrapperStruct00.var_1_12 [L64] unsigned long int stepLocal_1 = WrapperStruct00.var_1_12; [L65] EXPR WrapperStruct00.var_1_9 [L65] signed short int stepLocal_0 = WrapperStruct00.var_1_9; [L66] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L66] COND FALSE !(stepLocal_0 >= WrapperStruct00.var_1_10) [L73] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L73] COND FALSE !(WrapperStruct00.var_1_2) [L76] EXPR WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_8 [L76] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L76] COND FALSE !((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) [L79] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L79] COND FALSE !(WrapperStruct00.var_1_2) [L84] EXPR WrapperStruct00.var_1_15 [L84] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_15 [L87] EXPR WrapperStruct00.var_1_7 [L87] EXPR WrapperStruct00.var_1_8 [L87] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L87] COND FALSE !(WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1 [L124] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)))) [L124] EXPR WrapperStruct00.var_1_7 [L124] EXPR WrapperStruct00.var_1_8 [L124] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))) [L124] EXPR WrapperStruct00.var_1_6 [L124] EXPR WrapperStruct00.var_1_15 [L124] EXPR WrapperStruct00.var_1_15 [L124] EXPR ((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1)) && ((WrapperStruct00.var_1_9 >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_9 + last_1_WrapperStruct00_var_1_15) >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1)) && ((WrapperStruct00.var_1_9 >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_9 + last_1_WrapperStruct00_var_1_15) >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124-L125] return ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_3 + ((((WrapperStruct00.var_1_4) < ((49.5 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_4) : ((49.5 + WrapperStruct00.var_1_5))))))) : 1) && (((- (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) <= WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_6 == ((signed short int) ((8 + WrapperStruct00.var_1_15) - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_11 ? (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15)) : 1) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_12 == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && ((WrapperStruct00.var_1_7 < (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13 == ((float) ((((WrapperStruct00.var_1_4) > (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_4) : (((((((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) > (WrapperStruct00.var_1_3)) ? (((((127.4f) > (WrapperStruct00.var_1_5)) ? (127.4f) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_3)))))))) : 1)) && ((WrapperStruct00.var_1_9 >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_9 + last_1_WrapperStruct00_var_1_15) >= WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16))) : 1) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 137 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 804 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 803 mSDsluCounter, 4154 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2921 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2287 IncrementalHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 1233 mSDtfsCounter, 2287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=481occurred in iteration=6, InterpolantAutomatonStates: 35, 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, 7 MinimizatonAttempts, 450 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1100 NumberOfCodeBlocks, 1100 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 954 ConstructedInterpolants, 0 QuantifiedInterpolants, 2052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3360/3360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:45:25,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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-17.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 a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:45:27,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:45:27,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:45:27,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:45:27,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:45:27,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:45:27,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:45:27,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:45:27,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:45:27,694 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:45:27,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:45:27,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:45:27,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:45:27,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:45:27,697 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:45:27,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:45:27,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:45:27,697 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:45:27,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:45:27,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:45:27,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:45:27,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:45:27,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:45:27,699 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:45:27,700 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:45:27,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:45:27,700 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:45:27,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:45:27,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:45:27,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:45:27,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:45:27,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:45:27,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:45:27,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:45:27,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:45:27,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:45:27,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:45:27,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:45:27,703 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:45:27,703 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:45:27,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:45:27,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:45:27,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:45:27,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:45:27,704 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:45:27,704 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 -> a3b2b2359789daf7bb58416c09d5d24053c0bcce4099550d43f78ef9b7c15c79 [2024-10-24 11:45:27,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:45:27,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:45:27,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:45:27,967 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:45:27,967 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:45:27,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i [2024-10-24 11:45:29,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:45:29,414 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:45:29,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-17.i [2024-10-24 11:45:29,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054dd13f6/bdfe93dfef614952a905c2c5a0bb187b/FLAGf356063fb [2024-10-24 11:45:29,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054dd13f6/bdfe93dfef614952a905c2c5a0bb187b [2024-10-24 11:45:29,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:45:29,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:45:29,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:45:29,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:45:29,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:45:29,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:29" (1/1) ... [2024-10-24 11:45:29,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669337cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:29, skipping insertion in model container [2024-10-24 11:45:29,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:29" (1/1) ... [2024-10-24 11:45:29,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:45:29,928 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-17.i[916,929] [2024-10-24 11:45:29,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:45:29,993 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:45:30,002 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-17.i[916,929] [2024-10-24 11:45:30,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:45:30,077 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:45:30,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30 WrapperNode [2024-10-24 11:45:30,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:45:30,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:45:30,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:45:30,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:45:30,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (1/1) ... [2024-10-24 11:45:30,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (1/1) ... [2024-10-24 11:45:30,171 INFO L138 Inliner]: procedures = 39, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 614 [2024-10-24 11:45:30,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:45:30,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:45:30,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:45:30,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:45:30,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (1/1) ... [2024-10-24 11:45:30,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (1/1) ... [2024-10-24 11:45:30,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (1/1) ... [2024-10-24 11:45:30,236 INFO L175 MemorySlicer]: Split 156 memory accesses to 2 slices as follows [2, 154]. 99 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 19 writes are split as follows [0, 19]. [2024-10-24 11:45:30,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (1/1) ... [2024-10-24 11:45:30,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (1/1) ... [2024-10-24 11:45:30,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (1/1) ... [2024-10-24 11:45:30,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (1/1) ... [2024-10-24 11:45:30,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (1/1) ... [2024-10-24 11:45:30,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (1/1) ... [2024-10-24 11:45:30,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:45:30,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:45:30,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:45:30,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:45:30,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (1/1) ... [2024-10-24 11:45:30,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:45:30,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:45:30,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:45:30,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:45:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:45:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:45:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:45:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:45:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:45:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:45:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:45:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:45:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:45:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:45:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:45:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:45:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:45:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:45:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:45:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:45:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:45:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:45:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:45:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:45:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:45:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:45:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:45:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:45:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:45:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:45:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:45:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:45:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:45:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:45:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:45:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:45:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:45:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:45:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:45:30,506 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:45:30,508 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:45:32,707 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-10-24 11:45:32,707 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:45:32,761 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:45:32,762 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:45:32,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:32 BoogieIcfgContainer [2024-10-24 11:45:32,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:45:32,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:45:32,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:45:32,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:45:32,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:45:29" (1/3) ... [2024-10-24 11:45:32,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1d72bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:32, skipping insertion in model container [2024-10-24 11:45:32,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:30" (2/3) ... [2024-10-24 11:45:32,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1d72bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:32, skipping insertion in model container [2024-10-24 11:45:32,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:32" (3/3) ... [2024-10-24 11:45:32,767 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-17.i [2024-10-24 11:45:32,780 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:45:32,780 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:45:32,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:45:32,832 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;@1308f5d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:45:32,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:45:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:45:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:45:32,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:32,847 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:32,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:32,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1736269305, now seen corresponding path program 1 times [2024-10-24 11:45:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:32,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817748280] [2024-10-24 11:45:32,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:32,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:32,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:32,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:45:32,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:45:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:33,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:45:33,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-24 11:45:33,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:45:33,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:33,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817748280] [2024-10-24 11:45:33,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817748280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:33,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:33,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:45:33,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070876541] [2024-10-24 11:45:33,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:33,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:45:33,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:33,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:45:33,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:45:33,318 INFO L87 Difference]: Start difference. First operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:33,375 INFO L93 Difference]: Finished difference Result 271 states and 428 transitions. [2024-10-24 11:45:33,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:45:33,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-24 11:45:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:33,383 INFO L225 Difference]: With dead ends: 271 [2024-10-24 11:45:33,384 INFO L226 Difference]: Without dead ends: 135 [2024-10-24 11:45:33,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:45:33,392 INFO L432 NwaCegarLoop]: 198 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, 198 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:33,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-24 11:45:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-24 11:45:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.452991452991453) internal successors, (170), 117 states have internal predecessors, (170), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:45:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2024-10-24 11:45:33,441 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 136 [2024-10-24 11:45:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:33,442 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2024-10-24 11:45:33,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2024-10-24 11:45:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:45:33,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:33,444 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:33,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:45:33,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:33,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:33,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:33,647 INFO L85 PathProgramCache]: Analyzing trace with hash 194679485, now seen corresponding path program 1 times [2024-10-24 11:45:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:33,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535278303] [2024-10-24 11:45:33,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:33,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:33,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:33,652 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:45:33,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:45:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:34,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:45:34,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-10-24 11:45:34,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:45:34,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:34,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535278303] [2024-10-24 11:45:34,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535278303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:34,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:34,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:45:34,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104448790] [2024-10-24 11:45:34,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:34,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:45:34,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:34,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:45:34,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:34,123 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:34,211 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2024-10-24 11:45:34,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:45:34,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-24 11:45:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:34,215 INFO L225 Difference]: With dead ends: 271 [2024-10-24 11:45:34,215 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 11:45:34,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:34,216 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:34,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:45:34,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 11:45:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-24 11:45:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:45:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2024-10-24 11:45:34,232 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 136 [2024-10-24 11:45:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:34,236 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2024-10-24 11:45:34,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:34,236 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2024-10-24 11:45:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:45:34,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:34,238 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:34,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:45:34,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:34,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:34,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2049878913, now seen corresponding path program 1 times [2024-10-24 11:45:34,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:34,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179541690] [2024-10-24 11:45:34,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:34,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:34,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:34,443 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:45:34,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:45:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:34,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:45:34,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:34,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:45:34,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:34,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179541690] [2024-10-24 11:45:34,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179541690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:34,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:34,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:45:34,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395393027] [2024-10-24 11:45:34,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:34,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:45:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:34,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:45:34,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:34,868 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:45:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:34,987 INFO L93 Difference]: Finished difference Result 275 states and 410 transitions. [2024-10-24 11:45:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:45:34,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-10-24 11:45:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:34,989 INFO L225 Difference]: With dead ends: 275 [2024-10-24 11:45:34,989 INFO L226 Difference]: Without dead ends: 139 [2024-10-24 11:45:34,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:34,990 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:34,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:45:34,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-24 11:45:35,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-10-24 11:45:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:45:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2024-10-24 11:45:35,008 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 206 transitions. Word has length 136 [2024-10-24 11:45:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:35,008 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 206 transitions. [2024-10-24 11:45:35,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:45:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2024-10-24 11:45:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:45:35,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:35,010 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:35,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:45:35,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:35,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:35,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash 776557572, now seen corresponding path program 1 times [2024-10-24 11:45:35,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:35,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084977451] [2024-10-24 11:45:35,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:35,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:35,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:35,214 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:45:35,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:45:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:35,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:45:35,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:35,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:45:35,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-24 11:45:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-24 11:45:35,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:45:35,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:35,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084977451] [2024-10-24 11:45:35,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084977451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:35,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:35,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:45:35,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297014107] [2024-10-24 11:45:35,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:35,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:45:35,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:35,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:45:35,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:35,886 INFO L87 Difference]: Start difference. First operand 139 states and 206 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:39,182 INFO L93 Difference]: Finished difference Result 278 states and 412 transitions. [2024-10-24 11:45:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:45:39,183 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2024-10-24 11:45:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:39,184 INFO L225 Difference]: With dead ends: 278 [2024-10-24 11:45:39,185 INFO L226 Difference]: Without dead ends: 140 [2024-10-24 11:45:39,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 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-24 11:45:39,186 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 172 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:39,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 476 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 11:45:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-24 11:45:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-10-24 11:45:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 121 states have internal predecessors, (173), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:45:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 205 transitions. [2024-10-24 11:45:39,192 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 205 transitions. Word has length 138 [2024-10-24 11:45:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:39,195 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 205 transitions. [2024-10-24 11:45:39,195 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 205 transitions. [2024-10-24 11:45:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 11:45:39,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:39,197 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:39,214 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-24 11:45:39,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:39,397 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:39,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1993789002, now seen corresponding path program 1 times [2024-10-24 11:45:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660848797] [2024-10-24 11:45:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:39,402 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:45:39,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:45:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:39,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:45:39,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:40,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:45:40,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-24 11:45:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-10-24 11:45:40,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:45:40,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:40,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660848797] [2024-10-24 11:45:40,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660848797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:40,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:40,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:45:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309971527] [2024-10-24 11:45:40,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:40,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:45:40,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:40,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:45:40,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:40,070 INFO L87 Difference]: Start difference. First operand 139 states and 205 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:43,060 INFO L93 Difference]: Finished difference Result 278 states and 410 transitions. [2024-10-24 11:45:43,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:45:43,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2024-10-24 11:45:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:43,063 INFO L225 Difference]: With dead ends: 278 [2024-10-24 11:45:43,063 INFO L226 Difference]: Without dead ends: 140 [2024-10-24 11:45:43,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 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-24 11:45:43,064 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 164 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:43,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 470 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-24 11:45:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-24 11:45:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-10-24 11:45:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.421487603305785) internal successors, (172), 121 states have internal predecessors, (172), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:45:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 204 transitions. [2024-10-24 11:45:43,079 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 204 transitions. Word has length 140 [2024-10-24 11:45:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:43,079 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 204 transitions. [2024-10-24 11:45:43,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 204 transitions. [2024-10-24 11:45:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 11:45:43,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:43,088 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:43,106 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-24 11:45:43,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:43,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:43,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1909274172, now seen corresponding path program 1 times [2024-10-24 11:45:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:43,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477234022] [2024-10-24 11:45:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:43,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:43,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:43,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:45:43,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:45:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:43,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:45:43,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:43,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:45:43,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-24 11:45:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-24 11:45:43,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:45:43,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:43,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477234022] [2024-10-24 11:45:43,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477234022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:43,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:43,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:45:43,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952731822] [2024-10-24 11:45:43,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:43,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:45:43,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:43,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:45:43,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:45:43,967 INFO L87 Difference]: Start difference. First operand 139 states and 204 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:47,001 INFO L93 Difference]: Finished difference Result 278 states and 408 transitions. [2024-10-24 11:45:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:45:47,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2024-10-24 11:45:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:47,003 INFO L225 Difference]: With dead ends: 278 [2024-10-24 11:45:47,003 INFO L226 Difference]: Without dead ends: 140 [2024-10-24 11:45:47,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 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-24 11:45:47,004 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 136 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:47,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 466 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 11:45:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-24 11:45:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-10-24 11:45:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.4132231404958677) internal successors, (171), 121 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 11:45:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 203 transitions. [2024-10-24 11:45:47,009 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 203 transitions. Word has length 142 [2024-10-24 11:45:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:47,010 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 203 transitions. [2024-10-24 11:45:47,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 11:45:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 203 transitions. [2024-10-24 11:45:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:45:47,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:47,011 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:47,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 11:45:47,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:47,212 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:47,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash 838356490, now seen corresponding path program 1 times [2024-10-24 11:45:47,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:47,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425946087] [2024-10-24 11:45:47,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:47,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:47,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:47,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:45:47,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 11:45:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:47,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:45:47,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:47,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 11:45:48,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:45:48,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:45:48,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2024-10-24 11:45:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:48,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:45:48,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:48,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425946087] [2024-10-24 11:45:48,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425946087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:48,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:48,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:45:48,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513399513] [2024-10-24 11:45:48,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:48,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:45:48,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:48,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:45:48,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:45:48,260 INFO L87 Difference]: Start difference. First operand 139 states and 203 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:45:58,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:45:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:59,305 INFO L93 Difference]: Finished difference Result 766 states and 1120 transitions. [2024-10-24 11:45:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:45:59,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 144 [2024-10-24 11:45:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:59,308 INFO L225 Difference]: With dead ends: 766 [2024-10-24 11:45:59,308 INFO L226 Difference]: Without dead ends: 628 [2024-10-24 11:45:59,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:45:59,310 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 921 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:59,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 937 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-10-24 11:45:59,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-10-24 11:45:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 318. [2024-10-24 11:45:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 283 states have (on average 1.4240282685512367) internal successors, (403), 283 states have internal predecessors, (403), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 11:45:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2024-10-24 11:45:59,339 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 144 [2024-10-24 11:45:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:59,341 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2024-10-24 11:45:59,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:45:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2024-10-24 11:45:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:45:59,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:59,343 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:45:59,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-24 11:45:59,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:59,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:59,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:59,548 INFO L85 PathProgramCache]: Analyzing trace with hash 29009864, now seen corresponding path program 1 times [2024-10-24 11:45:59,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:59,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077104990] [2024-10-24 11:45:59,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:59,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:45:59,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:59,551 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:45:59,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 11:45:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:00,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:46:00,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:00,016 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 35 treesize of output 29 [2024-10-24 11:46:00,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:00,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 54 [2024-10-24 11:46:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:46:00,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:00,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:00,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077104990] [2024-10-24 11:46:00,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077104990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:00,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:00,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:46:00,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770975671] [2024-10-24 11:46:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:00,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:46:00,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:00,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:46:00,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:46:00,075 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:46:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:04,850 INFO L93 Difference]: Finished difference Result 961 states and 1411 transitions. [2024-10-24 11:46:04,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:46:04,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 144 [2024-10-24 11:46:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:04,856 INFO L225 Difference]: With dead ends: 961 [2024-10-24 11:46:04,857 INFO L226 Difference]: Without dead ends: 644 [2024-10-24 11:46:04,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:46:04,858 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 176 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:04,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 955 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-24 11:46:04,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-10-24 11:46:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 642. [2024-10-24 11:46:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 573 states have (on average 1.418848167539267) internal successors, (813), 573 states have internal predecessors, (813), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 11:46:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 941 transitions. [2024-10-24 11:46:04,895 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 941 transitions. Word has length 144 [2024-10-24 11:46:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:04,896 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 941 transitions. [2024-10-24 11:46:04,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 11:46:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 941 transitions. [2024-10-24 11:46:04,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:46:04,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:04,897 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:04,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 11:46:05,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:05,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:05,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:05,098 INFO L85 PathProgramCache]: Analyzing trace with hash -768505528, now seen corresponding path program 1 times [2024-10-24 11:46:05,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:05,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347353132] [2024-10-24 11:46:05,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:05,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:46:05,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:05,101 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:46:05,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 11:46:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:05,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-24 11:46:05,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:05,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:46:05,887 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 37 treesize of output 25 [2024-10-24 11:46:07,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:07,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2024-10-24 11:46:14,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:14,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 41 [2024-10-24 11:46:14,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:14,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 61 [2024-10-24 11:46:23,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:23,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 67 [2024-10-24 11:46:23,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:23,693 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-24 11:46:23,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:23,902 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-24 11:46:24,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:24,123 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-24 11:46:24,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:24,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 87 [2024-10-24 11:46:35,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:35,460 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 86 treesize of output 103 [2024-10-24 11:46:35,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:35,883 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 101 treesize of output 106 [2024-10-24 11:46:36,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:46:36,185 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 116 treesize of output 133 [2024-10-24 11:46:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 317 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-24 11:46:36,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:46:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:46:48,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:48,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347353132] [2024-10-24 11:46:48,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347353132] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:46:48,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:46:48,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 17 [2024-10-24 11:46:48,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126250312] [2024-10-24 11:46:48,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:48,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:46:48,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:48,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:46:48,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=186, Unknown=14, NotChecked=0, Total=272 [2024-10-24 11:46:48,285 INFO L87 Difference]: Start difference. First operand 642 states and 941 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)