./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-21.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-21.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 6d3c7b5e20b9cb5aff7067fd2169333c3619ec19d2be169214693b588a238e0b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:45:51,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:45:51,345 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:51,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:45:51,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:45:51,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:45:51,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:45:51,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:45:51,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:45:51,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:45:51,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:45:51,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:45:51,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:45:51,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:45:51,390 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:45:51,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:45:51,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:45:51,391 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:45:51,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:45:51,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:45:51,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:45:51,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:45:51,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:45:51,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:45:51,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:45:51,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:45:51,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:45:51,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:45:51,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:45:51,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:45:51,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:45:51,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:45:51,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:45:51,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:45:51,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:45:51,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:45:51,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:45:51,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:45:51,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:45:51,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:45:51,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:45:51,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:45:51,403 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 -> 6d3c7b5e20b9cb5aff7067fd2169333c3619ec19d2be169214693b588a238e0b [2024-10-24 11:45:51,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:45:51,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:45:51,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:45:51,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:45:51,708 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:45:51,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i [2024-10-24 11:45:53,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:45:53,391 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:45:53,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i [2024-10-24 11:45:53,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c4b8e52b/1b0ad7c2e8864ac2ae127a3e0e4505a9/FLAG7863a52f8 [2024-10-24 11:45:53,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c4b8e52b/1b0ad7c2e8864ac2ae127a3e0e4505a9 [2024-10-24 11:45:53,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:45:53,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:45:53,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:45:53,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:45:53,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:45:53,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:53" (1/1) ... [2024-10-24 11:45:53,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183cf50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:53, skipping insertion in model container [2024-10-24 11:45:53,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:45:53" (1/1) ... [2024-10-24 11:45:53,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:45:53,650 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-21.i[916,929] [2024-10-24 11:45:53,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:45:53,705 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:45:53,715 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-21.i[916,929] [2024-10-24 11:45:53,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:45:53,775 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:45:53,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:53 WrapperNode [2024-10-24 11:45:53,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:45:53,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:45:53,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:45:53,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:45:53,782 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:53" (1/1) ... [2024-10-24 11:45:53,793 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:53" (1/1) ... [2024-10-24 11:45:53,829 INFO L138 Inliner]: procedures = 29, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 395 [2024-10-24 11:45:53,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:45:53,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:45:53,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:45:53,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:45:53,843 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:53" (1/1) ... [2024-10-24 11:45:53,844 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:53" (1/1) ... [2024-10-24 11:45:53,857 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:53" (1/1) ... [2024-10-24 11:45:53,878 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-10-24 11:45:53,878 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:53" (1/1) ... [2024-10-24 11:45:53,878 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:53" (1/1) ... [2024-10-24 11:45:53,892 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:53" (1/1) ... [2024-10-24 11:45:53,897 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:53" (1/1) ... [2024-10-24 11:45:53,900 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:53" (1/1) ... [2024-10-24 11:45:53,902 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:53" (1/1) ... [2024-10-24 11:45:53,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:45:53,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:45:53,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:45:53,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:45:53,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:53" (1/1) ... [2024-10-24 11:45:53,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:45:53,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:45:53,960 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:53,964 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:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:45:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:45:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:45:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:45:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:45:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:45:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:45:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:45:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:45:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:45:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:45:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:45:54,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:45:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:45:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:45:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:45:54,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:45:54,163 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:45:54,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:45:54,634 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-24 11:45:54,634 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:45:54,668 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:45:54,668 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:45:54,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:54 BoogieIcfgContainer [2024-10-24 11:45:54,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:45:54,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:45:54,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:45:54,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:45:54,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:45:53" (1/3) ... [2024-10-24 11:45:54,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6014f264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:54, skipping insertion in model container [2024-10-24 11:45:54,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:45:53" (2/3) ... [2024-10-24 11:45:54,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6014f264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:45:54, skipping insertion in model container [2024-10-24 11:45:54,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:45:54" (3/3) ... [2024-10-24 11:45:54,686 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-21.i [2024-10-24 11:45:54,701 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:45:54,701 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:45:54,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:45:54,778 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;@2d076b33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:45:54,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:45:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 11:45:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 11:45:54,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:54,795 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:54,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:54,803 INFO L85 PathProgramCache]: Analyzing trace with hash -735381027, now seen corresponding path program 1 times [2024-10-24 11:45:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:54,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472712734] [2024-10-24 11:45:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:55,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:45:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:55,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:55,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:45:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:45:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:55,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:55,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:55,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:45:55,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:55,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472712734] [2024-10-24 11:45:55,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472712734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:55,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:55,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:45:55,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33345510] [2024-10-24 11:45:55,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:55,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:45:55,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:55,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:45:55,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:45:55,247 INFO L87 Difference]: Start difference. First operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:45:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:55,278 INFO L93 Difference]: Finished difference Result 175 states and 275 transitions. [2024-10-24 11:45:55,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:45:55,283 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2024-10-24 11:45:55,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:55,290 INFO L225 Difference]: With dead ends: 175 [2024-10-24 11:45:55,290 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 11:45:55,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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:55,296 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:55,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 11:45:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 11:45:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 78 states have internal predecessors, (116), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 11:45:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2024-10-24 11:45:55,332 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 75 [2024-10-24 11:45:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:55,333 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2024-10-24 11:45:55,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:45:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2024-10-24 11:45:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 11:45:55,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:55,336 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:45:55,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:55,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2082953751, now seen corresponding path program 1 times [2024-10-24 11:45:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:55,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381537755] [2024-10-24 11:45:55,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:45:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:45:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:45:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:45:56,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:56,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381537755] [2024-10-24 11:45:56,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381537755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:56,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:56,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:45:56,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232373433] [2024-10-24 11:45:56,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:56,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:45:56,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:56,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:45:56,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:45:56,277 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:45:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:56,746 INFO L93 Difference]: Finished difference Result 289 states and 431 transitions. [2024-10-24 11:45:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:45:56,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2024-10-24 11:45:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:56,751 INFO L225 Difference]: With dead ends: 289 [2024-10-24 11:45:56,751 INFO L226 Difference]: Without dead ends: 203 [2024-10-24 11:45:56,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:45:56,754 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 224 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:56,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 451 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:45:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-24 11:45:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 177. [2024-10-24 11:45:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 160 states have (on average 1.4625) internal successors, (234), 160 states have internal predecessors, (234), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:45:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2024-10-24 11:45:56,777 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 75 [2024-10-24 11:45:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:56,778 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2024-10-24 11:45:56,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:45:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2024-10-24 11:45:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 11:45:56,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:56,780 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:45:56,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:56,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1726892820, now seen corresponding path program 1 times [2024-10-24 11:45:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:56,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436717613] [2024-10-24 11:45:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:56,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:45:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:45:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:45:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:45:56,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436717613] [2024-10-24 11:45:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436717613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:56,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:56,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:45:56,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927226007] [2024-10-24 11:45:56,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:56,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:45:56,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:56,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:45:56,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:45:56,936 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:45:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:56,989 INFO L93 Difference]: Finished difference Result 356 states and 527 transitions. [2024-10-24 11:45:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:45:56,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 78 [2024-10-24 11:45:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:56,992 INFO L225 Difference]: With dead ends: 356 [2024-10-24 11:45:56,992 INFO L226 Difference]: Without dead ends: 180 [2024-10-24 11:45:56,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:45:56,995 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:56,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-24 11:45:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-24 11:45:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 163 states have (on average 1.4478527607361964) internal successors, (236), 163 states have internal predecessors, (236), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:45:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 264 transitions. [2024-10-24 11:45:57,024 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 264 transitions. Word has length 78 [2024-10-24 11:45:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:57,025 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 264 transitions. [2024-10-24 11:45:57,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:45:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2024-10-24 11:45:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 11:45:57,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:57,028 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:45:57,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:57,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2091097675, now seen corresponding path program 1 times [2024-10-24 11:45:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:57,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331257031] [2024-10-24 11:45:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:57,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:45:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:57,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:57,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:45:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:45:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:57,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:57,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:57,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:45:57,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:57,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331257031] [2024-10-24 11:45:57,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331257031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:57,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:57,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:45:57,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397855037] [2024-10-24 11:45:57,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:57,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:45:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:57,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:45:57,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:45:57,792 INFO L87 Difference]: Start difference. First operand 180 states and 264 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:45:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:58,126 INFO L93 Difference]: Finished difference Result 475 states and 688 transitions. [2024-10-24 11:45:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:45:58,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2024-10-24 11:45:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:58,129 INFO L225 Difference]: With dead ends: 475 [2024-10-24 11:45:58,129 INFO L226 Difference]: Without dead ends: 296 [2024-10-24 11:45:58,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:45:58,132 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 68 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:58,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 761 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:45:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-24 11:45:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2024-10-24 11:45:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 267 states have (on average 1.4232209737827715) internal successors, (380), 269 states have internal predecessors, (380), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:45:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 420 transitions. [2024-10-24 11:45:58,164 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 420 transitions. Word has length 82 [2024-10-24 11:45:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:58,165 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 420 transitions. [2024-10-24 11:45:58,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:45:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 420 transitions. [2024-10-24 11:45:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:45:58,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:58,167 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:45:58,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:58,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:58,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1197318112, now seen corresponding path program 1 times [2024-10-24 11:45:58,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:58,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958685648] [2024-10-24 11:45:58,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:58,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:45:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:45:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:45:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:45:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:58,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958685648] [2024-10-24 11:45:58,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958685648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:58,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:58,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:45:58,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713443558] [2024-10-24 11:45:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:58,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:45:58,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:58,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:45:58,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:45:58,394 INFO L87 Difference]: Start difference. First operand 292 states and 420 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:45:58,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:58,459 INFO L93 Difference]: Finished difference Result 306 states and 437 transitions. [2024-10-24 11:45:58,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:45:58,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-24 11:45:58,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:58,464 INFO L225 Difference]: With dead ends: 306 [2024-10-24 11:45:58,465 INFO L226 Difference]: Without dead ends: 304 [2024-10-24 11:45:58,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:45:58,467 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:58,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 718 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:45:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-24 11:45:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-10-24 11:45:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 279 states have (on average 1.4050179211469533) internal successors, (392), 281 states have internal predecessors, (392), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:45:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 432 transitions. [2024-10-24 11:45:58,494 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 432 transitions. Word has length 84 [2024-10-24 11:45:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:58,495 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 432 transitions. [2024-10-24 11:45:58,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:45:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 432 transitions. [2024-10-24 11:45:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:45:58,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:58,498 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:45:58,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:58,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:58,499 INFO L85 PathProgramCache]: Analyzing trace with hash -178577291, now seen corresponding path program 1 times [2024-10-24 11:45:58,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:58,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582390734] [2024-10-24 11:45:58,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:58,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:45:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:45:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:45:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:45:58,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:58,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582390734] [2024-10-24 11:45:58,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582390734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:58,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:58,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:45:58,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410599224] [2024-10-24 11:45:58,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:58,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:45:58,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:58,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:45:58,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:45:58,575 INFO L87 Difference]: Start difference. First operand 304 states and 432 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:45:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:58,604 INFO L93 Difference]: Finished difference Result 610 states and 869 transitions. [2024-10-24 11:45:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:45:58,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-24 11:45:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:58,608 INFO L225 Difference]: With dead ends: 610 [2024-10-24 11:45:58,608 INFO L226 Difference]: Without dead ends: 307 [2024-10-24 11:45:58,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:45:58,611 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:58,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:58,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-24 11:45:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-10-24 11:45:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 282 states have (on average 1.400709219858156) internal successors, (395), 284 states have internal predecessors, (395), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:45:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 435 transitions. [2024-10-24 11:45:58,631 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 435 transitions. Word has length 84 [2024-10-24 11:45:58,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:58,632 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 435 transitions. [2024-10-24 11:45:58,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:45:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 435 transitions. [2024-10-24 11:45:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:45:58,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:58,634 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:45:58,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:58,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1199645645, now seen corresponding path program 1 times [2024-10-24 11:45:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:58,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516231887] [2024-10-24 11:45:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:45:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:45:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:45:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:45:59,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:59,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516231887] [2024-10-24 11:45:59,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516231887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:59,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:59,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:45:59,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513769981] [2024-10-24 11:45:59,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:59,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:45:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:59,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:45:59,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:45:59,217 INFO L87 Difference]: Start difference. First operand 307 states and 435 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:45:59,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:59,752 INFO L93 Difference]: Finished difference Result 927 states and 1316 transitions. [2024-10-24 11:45:59,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:45:59,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-24 11:45:59,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:59,756 INFO L225 Difference]: With dead ends: 927 [2024-10-24 11:45:59,756 INFO L226 Difference]: Without dead ends: 621 [2024-10-24 11:45:59,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:45:59,758 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 159 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:59,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 831 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:45:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-24 11:45:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 615. [2024-10-24 11:45:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 566 states have (on average 1.4063604240282686) internal successors, (796), 570 states have internal predecessors, (796), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:45:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 876 transitions. [2024-10-24 11:45:59,783 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 876 transitions. Word has length 84 [2024-10-24 11:45:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:59,783 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 876 transitions. [2024-10-24 11:45:59,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:45:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 876 transitions. [2024-10-24 11:45:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:45:59,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:59,784 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:45:59,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:59,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1653979727, now seen corresponding path program 1 times [2024-10-24 11:45:59,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:45:59,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184127416] [2024-10-24 11:45:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:45:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:45:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:45:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:45:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:45:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:45:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:45:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:45:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:45:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:45:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184127416] [2024-10-24 11:45:59,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184127416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:59,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:45:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100224845] [2024-10-24 11:45:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:59,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:45:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:45:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:45:59,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:45:59,985 INFO L87 Difference]: Start difference. First operand 615 states and 876 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:46:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:00,338 INFO L93 Difference]: Finished difference Result 1348 states and 1908 transitions. [2024-10-24 11:46:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:46:00,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-24 11:46:00,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:00,343 INFO L225 Difference]: With dead ends: 1348 [2024-10-24 11:46:00,344 INFO L226 Difference]: Without dead ends: 734 [2024-10-24 11:46:00,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:46:00,346 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 210 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:00,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 458 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:46:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-24 11:46:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 667. [2024-10-24 11:46:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 618 states have (on average 1.3883495145631068) internal successors, (858), 622 states have internal predecessors, (858), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:46:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 938 transitions. [2024-10-24 11:46:00,384 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 938 transitions. Word has length 85 [2024-10-24 11:46:00,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:00,385 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 938 transitions. [2024-10-24 11:46:00,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:46:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 938 transitions. [2024-10-24 11:46:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:46:00,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:00,386 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:46:00,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:00,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1783267983, now seen corresponding path program 1 times [2024-10-24 11:46:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:46:00,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360722525] [2024-10-24 11:46:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:46:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:00,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:46:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:00,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:46:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:00,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:46:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:00,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:46:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:00,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:46:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:00,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:46:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:00,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:46:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:46:00,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:46:00,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360722525] [2024-10-24 11:46:00,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360722525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:00,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:00,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:46:00,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396029770] [2024-10-24 11:46:00,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:00,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:46:00,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:46:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:46:00,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:46:00,552 INFO L87 Difference]: Start difference. First operand 667 states and 938 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:46:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:00,640 INFO L93 Difference]: Finished difference Result 1359 states and 1908 transitions. [2024-10-24 11:46:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:46:00,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 85 [2024-10-24 11:46:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:00,645 INFO L225 Difference]: With dead ends: 1359 [2024-10-24 11:46:00,646 INFO L226 Difference]: Without dead ends: 693 [2024-10-24 11:46:00,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:46:00,648 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:00,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 834 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:46:00,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-24 11:46:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 681. [2024-10-24 11:46:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 632 states have (on average 1.3781645569620253) internal successors, (871), 636 states have internal predecessors, (871), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:46:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 951 transitions. [2024-10-24 11:46:00,673 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 951 transitions. Word has length 85 [2024-10-24 11:46:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:00,674 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 951 transitions. [2024-10-24 11:46:00,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:46:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 951 transitions. [2024-10-24 11:46:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:46:00,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:00,675 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:46:00,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:00,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:00,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1048312301, now seen corresponding path program 1 times [2024-10-24 11:46:00,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:46:00,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739474479] [2024-10-24 11:46:00,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:46:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:46:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1729004677] [2024-10-24 11:46:00,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:00,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:46:00,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:46:00,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:46:00,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:46:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:46:00,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:46:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:46:01,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:46:01,001 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:46:01,002 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:46:01,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:46:01,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 11:46:01,207 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:46:01,254 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:46:01,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:46:01 BoogieIcfgContainer [2024-10-24 11:46:01,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:46:01,258 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:46:01,258 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:46:01,258 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:46:01,259 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:54" (3/4) ... [2024-10-24 11:46:01,261 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:46:01,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:46:01,262 INFO L158 Benchmark]: Toolchain (without parser) took 7839.18ms. Allocated memory was 165.7MB in the beginning and 295.7MB in the end (delta: 130.0MB). Free memory was 96.7MB in the beginning and 94.8MB in the end (delta: 1.9MB). Peak memory consumption was 133.7MB. Max. memory is 16.1GB. [2024-10-24 11:46:01,262 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 165.7MB. Free memory was 140.7MB in the beginning and 140.6MB in the end (delta: 85.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:46:01,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.41ms. Allocated memory is still 165.7MB. Free memory was 96.5MB in the beginning and 124.4MB in the end (delta: -27.9MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2024-10-24 11:46:01,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.21ms. Allocated memory is still 165.7MB. Free memory was 123.8MB in the beginning and 120.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:46:01,263 INFO L158 Benchmark]: Boogie Preprocessor took 80.05ms. Allocated memory is still 165.7MB. Free memory was 120.8MB in the beginning and 116.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:46:01,264 INFO L158 Benchmark]: RCFGBuilder took 757.61ms. Allocated memory is still 165.7MB. Free memory was 116.6MB in the beginning and 85.5MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 11:46:01,264 INFO L158 Benchmark]: TraceAbstraction took 6586.43ms. Allocated memory was 165.7MB in the beginning and 295.7MB in the end (delta: 130.0MB). Free memory was 84.6MB in the beginning and 94.8MB in the end (delta: -10.2MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. [2024-10-24 11:46:01,264 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 295.7MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:46:01,265 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.17ms. Allocated memory is still 165.7MB. Free memory was 140.7MB in the beginning and 140.6MB in the end (delta: 85.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.41ms. Allocated memory is still 165.7MB. Free memory was 96.5MB in the beginning and 124.4MB in the end (delta: -27.9MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.21ms. Allocated memory is still 165.7MB. Free memory was 123.8MB in the beginning and 120.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.05ms. Allocated memory is still 165.7MB. Free memory was 120.8MB in the beginning and 116.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 757.61ms. Allocated memory is still 165.7MB. Free memory was 116.6MB in the beginning and 85.5MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6586.43ms. Allocated memory was 165.7MB in the beginning and 295.7MB in the end (delta: 130.0MB). Free memory was 84.6MB in the beginning and 94.8MB in the end (delta: -10.2MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 295.7MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 87. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L45] unsigned char last_1_WrapperStruct0_var_1_7 = 0; [L46] signed short int last_1_WrapperStruct0_var_1_13 = 256; [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L90] EXPR WrapperStruct0.var_1_7 [L90] last_1_WrapperStruct0_var_1_7 = WrapperStruct0.var_1_7 [L91] EXPR WrapperStruct0.var_1_13 [L91] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L101] RET updateLastVariables() [L102] CALL updateVariables() [L75] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L76] EXPR WrapperStruct0.var_1_8 [L76] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L76] EXPR WrapperStruct0.var_1_8 [L76] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L77] WrapperStruct0.var_1_9 = __VERIFIER_nondet_double() [L78] EXPR WrapperStruct0.var_1_9 [L78] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L78] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F [L78] EXPR WrapperStruct0.var_1_9 [L78] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L78] EXPR (WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L78] EXPR (WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L78] CALL assume_abort_if_not((WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L78] RET assume_abort_if_not((WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L79] WrapperStruct0.var_1_10 = __VERIFIER_nondet_double() [L80] EXPR WrapperStruct0.var_1_10 [L80] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L80] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F [L80] EXPR WrapperStruct0.var_1_10 [L80] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L80] EXPR (WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L80] EXPR (WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L80] CALL assume_abort_if_not((WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L80] RET assume_abort_if_not((WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L81] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L82] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L82] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L82] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L83] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L83] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L83] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L84] WrapperStruct0.var_1_14 = __VERIFIER_nondet_float() [L85] EXPR WrapperStruct0.var_1_14 [L85] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F [L85] EXPR WrapperStruct0.var_1_14 [L85] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR (WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR (WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] CALL assume_abort_if_not((WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] RET assume_abort_if_not((WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L86] WrapperStruct0.var_1_15 = __VERIFIER_nondet_float() [L87] EXPR WrapperStruct0.var_1_15 [L87] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F [L87] EXPR WrapperStruct0.var_1_15 [L87] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR (WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR (WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] CALL assume_abort_if_not((WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] RET assume_abort_if_not((WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L102] RET updateVariables() [L103] CALL step() [L50] COND TRUE (last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L51] COND FALSE !(last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L59] WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L59] COND TRUE WrapperStruct0.var_1_12 [L60] EXPR WrapperStruct0.var_1_14 [L60] EXPR WrapperStruct0.var_1_15 [L60] EXPR WrapperStruct0.var_1_8 [L60] EXPR WrapperStruct0.var_1_10 [L60] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L60] COND FALSE !((WrapperStruct0.var_1_14 - WrapperStruct0.var_1_15) >= ((WrapperStruct0.var_1_8 + WrapperStruct0.var_1_10) + WrapperStruct0.var_1_9)) [L63] EXPR WrapperStruct0.var_1_1 [L63] WrapperStruct0.var_1_13 = WrapperStruct0.var_1_1 [L66] EXPR WrapperStruct0.var_1_8 [L66] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L66] EXPR ((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9) [L66] EXPR WrapperStruct0.var_1_8 [L66] EXPR ((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L66] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L66] COND TRUE ((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10 [L67] last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L67] last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L67] COND FALSE !(last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR ((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1 [L94] EXPR (last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR ((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && ((((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && ((((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12))) [L94] EXPR WrapperStruct0.var_1_8 [L94] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR ((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9) [L94] EXPR WrapperStruct0.var_1_8 [L94] EXPR ((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12)) [L94] EXPR WrapperStruct0.var_1_7 [L94] EXPR WrapperStruct0.var_1_12 [L94] EXPR (((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && ((((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && ((((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12)))) && (WrapperStruct0.var_1_12 ? (((WrapperStruct0.var_1_14 - WrapperStruct0.var_1_15) >= ((WrapperStruct0.var_1_8 + WrapperStruct0.var_1_10) + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_13 == ((signed short int) ((((WrapperStruct0.var_1_1) > (WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_1) : (WrapperStruct0.var_1_1))))) : (WrapperStruct0.var_1_13 == ((signed short int) WrapperStruct0.var_1_1))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && ((((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12)))) && (WrapperStruct0.var_1_12 ? (((WrapperStruct0.var_1_14 - WrapperStruct0.var_1_15) >= ((WrapperStruct0.var_1_8 + WrapperStruct0.var_1_10) + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_13 == ((signed short int) ((((WrapperStruct0.var_1_1) > (WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_1) : (WrapperStruct0.var_1_1))))) : (WrapperStruct0.var_1_13 == ((signed short int) WrapperStruct0.var_1_1))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94-L95] return ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : (WrapperStruct0.var_1_1 == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && ((((((WrapperStruct0.var_1_8) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_9))) <= WrapperStruct0.var_1_10) ? ((last_1_WrapperStruct0_var_1_7 && (WrapperStruct0.var_1_1 >= WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_7 == ((unsigned char) 0)) : 1) : (WrapperStruct0.var_1_7 == ((unsigned char) WrapperStruct0.var_1_12)))) && (WrapperStruct0.var_1_12 ? (((WrapperStruct0.var_1_14 - WrapperStruct0.var_1_15) >= ((WrapperStruct0.var_1_8 + WrapperStruct0.var_1_10) + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_13 == ((signed short int) ((((WrapperStruct0.var_1_1) > (WrapperStruct0.var_1_1)) ? (WrapperStruct0.var_1_1) : (WrapperStruct0.var_1_1))))) : (WrapperStruct0.var_1_13 == ((signed short int) WrapperStruct0.var_1_1))) : 1) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L19] reach_error() VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 662 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 661 mSDsluCounter, 4907 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3817 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1715 IncrementalHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 1090 mSDtfsCounter, 1715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=681occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 115 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 723 ConstructedInterpolants, 0 QuantifiedInterpolants, 1729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 756/756 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:46:01,302 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-21.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 6d3c7b5e20b9cb5aff7067fd2169333c3619ec19d2be169214693b588a238e0b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:46:03,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:46:03,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:46:03,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:46:03,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:46:03,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:46:03,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:46:03,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:46:03,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:46:03,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:46:03,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:46:03,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:46:03,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:46:03,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:46:03,638 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:46:03,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:46:03,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:46:03,639 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:46:03,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:46:03,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:46:03,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:46:03,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:46:03,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:46:03,645 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:46:03,646 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:46:03,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:46:03,647 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:46:03,647 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:46:03,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:46:03,648 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:46:03,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:46:03,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:46:03,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:46:03,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:46:03,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:46:03,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:46:03,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:46:03,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:46:03,651 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:46:03,651 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:46:03,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:46:03,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:46:03,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:46:03,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:46:03,653 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:46:03,654 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 -> 6d3c7b5e20b9cb5aff7067fd2169333c3619ec19d2be169214693b588a238e0b [2024-10-24 11:46:03,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:46:04,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:46:04,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:46:04,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:46:04,016 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:46:04,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i [2024-10-24 11:46:05,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:46:05,754 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:46:05,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-21.i [2024-10-24 11:46:05,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4a7223a/6cfd454af57942ed8e15063df667c42e/FLAG6ad3afcdf [2024-10-24 11:46:05,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4a7223a/6cfd454af57942ed8e15063df667c42e [2024-10-24 11:46:05,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:46:05,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:46:05,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:46:05,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:46:05,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:46:05,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:46:05" (1/1) ... [2024-10-24 11:46:05,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39016bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:05, skipping insertion in model container [2024-10-24 11:46:05,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:46:05" (1/1) ... [2024-10-24 11:46:05,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:46:06,005 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-21.i[916,929] [2024-10-24 11:46:06,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:46:06,091 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:46:06,104 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-21.i[916,929] [2024-10-24 11:46:06,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:46:06,190 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:46:06,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:06 WrapperNode [2024-10-24 11:46:06,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:46:06,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:46:06,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:46:06,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:46:06,199 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:46:06" (1/1) ... [2024-10-24 11:46:06,223 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:46:06" (1/1) ... [2024-10-24 11:46:06,261 INFO L138 Inliner]: procedures = 36, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 395 [2024-10-24 11:46:06,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:46:06,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:46:06,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:46:06,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:46:06,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:06" (1/1) ... [2024-10-24 11:46:06,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:06" (1/1) ... [2024-10-24 11:46:06,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:06" (1/1) ... [2024-10-24 11:46:06,332 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-10-24 11:46:06,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:06" (1/1) ... [2024-10-24 11:46:06,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:06" (1/1) ... [2024-10-24 11:46:06,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:06" (1/1) ... [2024-10-24 11:46:06,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:06" (1/1) ... [2024-10-24 11:46:06,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:06" (1/1) ... [2024-10-24 11:46:06,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:06" (1/1) ... [2024-10-24 11:46:06,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:46:06,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:46:06,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:46:06,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:46:06,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:06" (1/1) ... [2024-10-24 11:46:06,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:46:06,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:46:06,447 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:46:06,451 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:46:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:46:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:46:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:46:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:46:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:46:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:46:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:46:06,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:46:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:46:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:46:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:46:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:46:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:46:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:46:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:46:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:46:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:46:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:46:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:46:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:46:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:46:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:46:06,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:46:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:46:06,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:46:06,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:46:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:46:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:46:06,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:46:06,649 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:46:06,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:46:17,062 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-10-24 11:46:17,062 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:46:17,103 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:46:17,103 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:46:17,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:46:17 BoogieIcfgContainer [2024-10-24 11:46:17,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:46:17,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:46:17,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:46:17,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:46:17,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:46:05" (1/3) ... [2024-10-24 11:46:17,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bf2fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:46:17, skipping insertion in model container [2024-10-24 11:46:17,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:46:06" (2/3) ... [2024-10-24 11:46:17,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bf2fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:46:17, skipping insertion in model container [2024-10-24 11:46:17,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:46:17" (3/3) ... [2024-10-24 11:46:17,113 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-21.i [2024-10-24 11:46:17,129 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:46:17,129 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:46:17,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:46:17,198 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;@17b9b10b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:46:17,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:46:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 11:46:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 11:46:17,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:17,224 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:17,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash -735381027, now seen corresponding path program 1 times [2024-10-24 11:46:17,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:17,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548266083] [2024-10-24 11:46:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:17,246 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:17,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:17,249 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:46:17,251 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:46:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:17,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:46:17,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:46:17,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:17,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:17,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548266083] [2024-10-24 11:46:17,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548266083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:17,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:17,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:46:17,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818767294] [2024-10-24 11:46:17,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:17,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:46:17,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:17,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:46:17,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:46:17,616 INFO L87 Difference]: Start difference. First operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:46:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:17,668 INFO L93 Difference]: Finished difference Result 175 states and 275 transitions. [2024-10-24 11:46:17,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:46:17,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2024-10-24 11:46:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:17,677 INFO L225 Difference]: With dead ends: 175 [2024-10-24 11:46:17,677 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 11:46:17,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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:46:17,683 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:17,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:46:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 11:46:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 11:46:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 78 states have internal predecessors, (116), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 11:46:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2024-10-24 11:46:17,721 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 75 [2024-10-24 11:46:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:17,722 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2024-10-24 11:46:17,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:46:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2024-10-24 11:46:17,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 11:46:17,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:17,725 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,736 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:46:17,926 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:46:17,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:17,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2082953751, now seen corresponding path program 1 times [2024-10-24 11:46:17,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:17,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609290794] [2024-10-24 11:46:17,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:17,928 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:17,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:17,931 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:46:17,932 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:46:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:18,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:46:18,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:18,309 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:46:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:46:18,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:18,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:18,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609290794] [2024-10-24 11:46:18,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609290794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:18,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:18,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:46:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743306950] [2024-10-24 11:46:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:46:18,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:18,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:46:18,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:46:18,674 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:46:20,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:21,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:25,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:27,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:28,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:31,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:32,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:32,887 INFO L93 Difference]: Finished difference Result 289 states and 431 transitions. [2024-10-24 11:46:32,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:46:32,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2024-10-24 11:46:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:32,890 INFO L225 Difference]: With dead ends: 289 [2024-10-24 11:46:32,890 INFO L226 Difference]: Without dead ends: 203 [2024-10-24 11:46:32,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:46:32,892 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 221 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:32,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 260 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2024-10-24 11:46:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-24 11:46:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 177. [2024-10-24 11:46:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 160 states have (on average 1.4625) internal successors, (234), 160 states have internal predecessors, (234), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:46:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2024-10-24 11:46:32,918 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 75 [2024-10-24 11:46:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:32,919 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2024-10-24 11:46:32,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:46:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2024-10-24 11:46:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 11:46:32,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:32,922 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,933 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 (3)] Ended with exit code 0 [2024-10-24 11:46:33,122 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:46:33,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:33,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1726892820, now seen corresponding path program 1 times [2024-10-24 11:46:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:33,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685916784] [2024-10-24 11:46:33,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:33,125 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:33,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:33,128 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:46:33,128 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:46:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:33,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:46:33,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:46:33,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:33,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:33,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685916784] [2024-10-24 11:46:33,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685916784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:33,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:33,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:46:33,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523270075] [2024-10-24 11:46:33,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:33,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:46:33,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:33,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:46:33,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:46:33,419 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:46:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:33,580 INFO L93 Difference]: Finished difference Result 356 states and 527 transitions. [2024-10-24 11:46:33,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:46:33,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 78 [2024-10-24 11:46:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:33,583 INFO L225 Difference]: With dead ends: 356 [2024-10-24 11:46:33,583 INFO L226 Difference]: Without dead ends: 180 [2024-10-24 11:46:33,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:46:33,586 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:33,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:46:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-24 11:46:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-24 11:46:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 163 states have (on average 1.4478527607361964) internal successors, (236), 163 states have internal predecessors, (236), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:46:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 264 transitions. [2024-10-24 11:46:33,608 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 264 transitions. Word has length 78 [2024-10-24 11:46:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:33,609 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 264 transitions. [2024-10-24 11:46:33,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:46:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2024-10-24 11:46:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 11:46:33,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:33,614 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:46:33,814 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:46:33,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:33,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:33,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2091097675, now seen corresponding path program 1 times [2024-10-24 11:46:33,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:33,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880027366] [2024-10-24 11:46:33,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:33,817 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:33,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:33,820 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:46:33,821 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:46:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:34,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:46:34,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:34,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-24 11:46:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-24 11:46:34,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:34,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:34,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880027366] [2024-10-24 11:46:34,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880027366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:34,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:34,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:46:34,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307675641] [2024-10-24 11:46:34,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:34,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:46:34,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:34,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:46:34,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:46:34,368 INFO L87 Difference]: Start difference. First operand 180 states and 264 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:46:36,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:38,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:40,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:42,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:42,643 INFO L93 Difference]: Finished difference Result 361 states and 529 transitions. [2024-10-24 11:46:42,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:46:42,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2024-10-24 11:46:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:42,646 INFO L225 Difference]: With dead ends: 361 [2024-10-24 11:46:42,646 INFO L226 Difference]: Without dead ends: 182 [2024-10-24 11:46:42,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 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:46:42,650 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 101 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:42,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 359 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-10-24 11:46:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-24 11:46:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2024-10-24 11:46:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 163 states have (on average 1.4355828220858895) internal successors, (234), 163 states have internal predecessors, (234), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:46:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 262 transitions. [2024-10-24 11:46:42,672 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 262 transitions. Word has length 82 [2024-10-24 11:46:42,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:42,673 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 262 transitions. [2024-10-24 11:46:42,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:46:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 262 transitions. [2024-10-24 11:46:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:46:42,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:42,675 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,685 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:46:42,879 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:46:42,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:42,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:42,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1614138991, now seen corresponding path program 1 times [2024-10-24 11:46:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:42,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871039914] [2024-10-24 11:46:42,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:42,880 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:42,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:42,883 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:46:42,885 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:46:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:43,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:46:43,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:43,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-24 11:46:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 11:46:43,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:46:43,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:43,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871039914] [2024-10-24 11:46:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871039914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:46:43,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:46:43,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:46:43,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413621869] [2024-10-24 11:46:43,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:46:43,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:46:43,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:43,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:46:43,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:46:43,367 INFO L87 Difference]: Start difference. First operand 180 states and 262 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:46:45,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:46,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:48,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:51,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:46:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:46:51,282 INFO L93 Difference]: Finished difference Result 361 states and 525 transitions. [2024-10-24 11:46:51,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:46:51,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 84 [2024-10-24 11:46:51,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:46:51,286 INFO L225 Difference]: With dead ends: 361 [2024-10-24 11:46:51,286 INFO L226 Difference]: Without dead ends: 182 [2024-10-24 11:46:51,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 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:46:51,287 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 91 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:46:51,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 357 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-10-24 11:46:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-24 11:46:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2024-10-24 11:46:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 163 states have (on average 1.4233128834355828) internal successors, (232), 163 states have internal predecessors, (232), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:46:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 260 transitions. [2024-10-24 11:46:51,311 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 260 transitions. Word has length 84 [2024-10-24 11:46:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:46:51,312 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 260 transitions. [2024-10-24 11:46:51,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:46:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 260 transitions. [2024-10-24 11:46:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 11:46:51,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:46:51,313 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 11:46:51,514 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:46:51,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:46:51,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:46:51,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1863132427, now seen corresponding path program 1 times [2024-10-24 11:46:51,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:46:51,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224721490] [2024-10-24 11:46:51,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:46:51,516 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:51,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:46:51,517 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:46:51,518 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:46:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:46:51,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 11:46:51,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:46:51,886 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:46:52,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-10-24 11:46:52,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-10-24 11:46:53,023 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 43 treesize of output 19 [2024-10-24 11:46:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 11:46:53,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:46:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-24 11:46:53,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:46:53,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224721490] [2024-10-24 11:46:53,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224721490] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:46:53,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:46:53,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-10-24 11:46:53,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020875891] [2024-10-24 11:46:53,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:46:53,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 11:46:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:46:53,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 11:46:53,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:46:53,606 INFO L87 Difference]: Start difference. First operand 180 states and 260 transitions. Second operand has 18 states, 14 states have (on average 6.071428571428571) internal successors, (85), 16 states have internal predecessors, (85), 7 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-24 11:46:56,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:46:59,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:47:02,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:47:05,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:47:07,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:47:08,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:47:08,450 INFO L93 Difference]: Finished difference Result 345 states and 488 transitions. [2024-10-24 11:47:08,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 11:47:08,452 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 6.071428571428571) internal successors, (85), 16 states have internal predecessors, (85), 7 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 86 [2024-10-24 11:47:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:47:08,454 INFO L225 Difference]: With dead ends: 345 [2024-10-24 11:47:08,454 INFO L226 Difference]: Without dead ends: 166 [2024-10-24 11:47:08,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:47:08,456 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 169 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 26 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:47:08,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 409 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 482 Invalid, 6 Unknown, 0 Unchecked, 14.6s Time] [2024-10-24 11:47:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-24 11:47:08,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-24 11:47:08,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 145 states have (on average 1.3724137931034484) internal successors, (199), 145 states have internal predecessors, (199), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:47:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 227 transitions. [2024-10-24 11:47:08,476 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 227 transitions. Word has length 86 [2024-10-24 11:47:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:47:08,477 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 227 transitions. [2024-10-24 11:47:08,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 6.071428571428571) internal successors, (85), 16 states have internal predecessors, (85), 7 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-24 11:47:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 227 transitions. [2024-10-24 11:47:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:47:08,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:47:08,479 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:08,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 11:47:08,679 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:47:08,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:47:08,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:47:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1232146795, now seen corresponding path program 1 times [2024-10-24 11:47:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:47:08,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018533679] [2024-10-24 11:47:08,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:47:08,681 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:47:08,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:47:08,682 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:47:08,683 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:47:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:47:09,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 11:47:09,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:47:09,191 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:47:09,482 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 42 treesize of output 20 [2024-10-24 11:47:09,613 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 42 treesize of output 20 [2024-10-24 11:47:09,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:47:09,792 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 42 treesize of output 38 [2024-10-24 11:47:09,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:47:09,934 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 59 treesize of output 52 [2024-10-24 11:47:10,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:47:10,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 45 [2024-10-24 11:47:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 53 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 11:47:10,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:47:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:47:10,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:47:10,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018533679] [2024-10-24 11:47:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018533679] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:47:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:47:10,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2024-10-24 11:47:10,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175847384] [2024-10-24 11:47:10,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:47:10,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:47:10,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:47:10,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:47:10,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:47:10,638 INFO L87 Difference]: Start difference. First operand 166 states and 227 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:47:13,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:47:16,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:47:18,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []