./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-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.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 d3e0774e78cf4ed6ba09a877be2127aeb0fe9129940fc78943597bbe0bd3d6c8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:02:28,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:02:28,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:02:28,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:02:28,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:02:28,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:02:28,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:02:28,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:02:28,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:02:28,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:02:28,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:02:28,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:02:28,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:02:28,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:02:28,491 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:02:28,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:02:28,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:02:28,492 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:02:28,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:02:28,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:02:28,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:02:28,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:02:28,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:02:28,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:02:28,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:02:28,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:02:28,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:02:28,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:02:28,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:02:28,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:02:28,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:02:28,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:02:28,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:02:28,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:02:28,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:02:28,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:02:28,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:02:28,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:02:28,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:02:28,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:02:28,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:02:28,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:02:28,505 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 -> d3e0774e78cf4ed6ba09a877be2127aeb0fe9129940fc78943597bbe0bd3d6c8 [2024-10-14 14:02:28,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:02:28,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:02:28,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:02:28,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:02:28,815 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:02:28,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i [2024-10-14 14:02:30,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:02:30,547 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:02:30,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i [2024-10-14 14:02:30,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abdba83d5/bf1c932458364d1096a0e14bab51df28/FLAG8b984b0e4 [2024-10-14 14:02:30,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abdba83d5/bf1c932458364d1096a0e14bab51df28 [2024-10-14 14:02:30,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:02:30,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:02:30,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:02:30,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:02:30,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:02:30,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:30,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14efe736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30, skipping insertion in model container [2024-10-14 14:02:30,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:30,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:02:30,800 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-96.i[916,929] [2024-10-14 14:02:30,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:02:30,901 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:02:30,912 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-96.i[916,929] [2024-10-14 14:02:30,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:02:30,994 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:02:30,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30 WrapperNode [2024-10-14 14:02:30,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:02:30,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:02:30,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:02:30,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:02:31,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:31,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:31,058 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2024-10-14 14:02:31,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:02:31,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:02:31,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:02:31,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:02:31,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:31,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:31,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:31,107 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 18 writes are split as follows [0, 18]. [2024-10-14 14:02:31,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:31,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:31,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:31,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:31,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:31,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:31,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:02:31,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:02:31,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:02:31,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:02:31,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (1/1) ... [2024-10-14 14:02:31,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:02:31,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:02:31,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:02:31,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:02:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:02:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 14:02:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 14:02:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 14:02:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 14:02:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 14:02:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 14:02:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 14:02:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 14:02:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 14:02:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 14:02:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:02:31,277 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:02:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:02:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 14:02:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:02:31,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:02:31,387 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:02:31,389 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:02:31,915 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-10-14 14:02:31,916 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:02:31,949 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:02:31,949 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:02:31,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:02:31 BoogieIcfgContainer [2024-10-14 14:02:31,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:02:31,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:02:31,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:02:31,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:02:31,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:02:30" (1/3) ... [2024-10-14 14:02:31,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395045e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:02:31, skipping insertion in model container [2024-10-14 14:02:31,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:30" (2/3) ... [2024-10-14 14:02:31,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395045e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:02:31, skipping insertion in model container [2024-10-14 14:02:31,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:02:31" (3/3) ... [2024-10-14 14:02:31,960 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-96.i [2024-10-14 14:02:31,979 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:02:31,979 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:02:32,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:02:32,056 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;@7be307cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:02:32,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:02:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 14:02:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:02:32,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:32,077 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:32,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:32,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:32,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1451166317, now seen corresponding path program 1 times [2024-10-14 14:02:32,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:32,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174942888] [2024-10-14 14:02:32,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:32,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:32,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:32,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174942888] [2024-10-14 14:02:32,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174942888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:32,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:32,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:02:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185621437] [2024-10-14 14:02:32,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:32,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:02:32,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:32,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:02:32,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:02:32,552 INFO L87 Difference]: Start difference. First operand has 101 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 14:02:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:32,594 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2024-10-14 14:02:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:02:32,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-10-14 14:02:32,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:32,604 INFO L225 Difference]: With dead ends: 199 [2024-10-14 14:02:32,604 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 14:02:32,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:02:32,614 INFO L432 NwaCegarLoop]: 143 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, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:32,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:02:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 14:02:32,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-14 14:02:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 14:02:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 147 transitions. [2024-10-14 14:02:32,654 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 147 transitions. Word has length 126 [2024-10-14 14:02:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:32,655 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 147 transitions. [2024-10-14 14:02:32,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 14:02:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 147 transitions. [2024-10-14 14:02:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:02:32,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:32,659 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:32,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:02:32,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:32,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:32,660 INFO L85 PathProgramCache]: Analyzing trace with hash 493140279, now seen corresponding path program 1 times [2024-10-14 14:02:32,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:32,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679686280] [2024-10-14 14:02:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:32,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:32,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:33,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:33,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679686280] [2024-10-14 14:02:33,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679686280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:33,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:33,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:02:33,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55936818] [2024-10-14 14:02:33,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:33,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:02:33,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:33,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:02:33,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:02:33,082 INFO L87 Difference]: Start difference. First operand 99 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:33,148 INFO L93 Difference]: Finished difference Result 200 states and 297 transitions. [2024-10-14 14:02:33,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:02:33,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 14:02:33,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:33,154 INFO L225 Difference]: With dead ends: 200 [2024-10-14 14:02:33,156 INFO L226 Difference]: Without dead ends: 102 [2024-10-14 14:02:33,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:02:33,159 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:33,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 413 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:02:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-14 14:02:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-10-14 14:02:33,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 14:02:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 149 transitions. [2024-10-14 14:02:33,182 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 149 transitions. Word has length 126 [2024-10-14 14:02:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:33,184 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 149 transitions. [2024-10-14 14:02:33,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 149 transitions. [2024-10-14 14:02:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:02:33,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:33,188 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:33,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:02:33,188 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:33,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:33,189 INFO L85 PathProgramCache]: Analyzing trace with hash -316206347, now seen corresponding path program 1 times [2024-10-14 14:02:33,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:33,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248358656] [2024-10-14 14:02:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:33,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:33,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248358656] [2024-10-14 14:02:33,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248358656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:33,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:33,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:02:33,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741631368] [2024-10-14 14:02:33,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:33,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:02:33,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:33,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:02:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:02:33,432 INFO L87 Difference]: Start difference. First operand 101 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:33,476 INFO L93 Difference]: Finished difference Result 204 states and 301 transitions. [2024-10-14 14:02:33,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:02:33,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 14:02:33,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:33,478 INFO L225 Difference]: With dead ends: 204 [2024-10-14 14:02:33,479 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 14:02:33,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:02:33,484 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:33,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 414 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:02:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 14:02:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-14 14:02:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 14:02:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2024-10-14 14:02:33,503 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 126 [2024-10-14 14:02:33,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:33,504 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2024-10-14 14:02:33,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2024-10-14 14:02:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:02:33,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:33,508 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:33,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:02:33,508 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:33,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:33,509 INFO L85 PathProgramCache]: Analyzing trace with hash -258948045, now seen corresponding path program 1 times [2024-10-14 14:02:33,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:33,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155052992] [2024-10-14 14:02:33,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:33,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:33,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155052992] [2024-10-14 14:02:33,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155052992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:33,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:33,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:02:33,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428327887] [2024-10-14 14:02:33,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:33,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:02:33,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:33,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:02:33,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:02:33,693 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:33,723 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2024-10-14 14:02:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:02:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 14:02:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:33,726 INFO L225 Difference]: With dead ends: 208 [2024-10-14 14:02:33,726 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 14:02:33,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:02:33,728 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:33,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 417 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:02:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 14:02:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-14 14:02:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 87 states have internal predecessors, (121), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 14:02:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-10-14 14:02:33,736 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 126 [2024-10-14 14:02:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:33,737 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-10-14 14:02:33,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-10-14 14:02:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:02:33,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:33,739 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:33,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:02:33,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:33,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash -258888463, now seen corresponding path program 1 times [2024-10-14 14:02:33,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:33,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569152816] [2024-10-14 14:02:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:34,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569152816] [2024-10-14 14:02:34,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569152816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:34,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:34,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:02:34,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597593329] [2024-10-14 14:02:34,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:34,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:02:34,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:34,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:02:34,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:34,106 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:34,295 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2024-10-14 14:02:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:02:34,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 14:02:34,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:34,297 INFO L225 Difference]: With dead ends: 211 [2024-10-14 14:02:34,297 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 14:02:34,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:02:34,300 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:34,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 428 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:02:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 14:02:34,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-14 14:02:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 89 states have internal predecessors, (123), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 14:02:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-10-14 14:02:34,310 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 126 [2024-10-14 14:02:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:34,310 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-10-14 14:02:34,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-10-14 14:02:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:02:34,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:34,313 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:34,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:02:34,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:34,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:34,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2041934127, now seen corresponding path program 1 times [2024-10-14 14:02:34,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:34,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523713254] [2024-10-14 14:02:34,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:34,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:35,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:35,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523713254] [2024-10-14 14:02:35,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523713254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:35,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:35,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:02:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619024361] [2024-10-14 14:02:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:35,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:02:35,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:35,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:02:35,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:02:35,967 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 14:02:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:36,452 INFO L93 Difference]: Finished difference Result 284 states and 409 transitions. [2024-10-14 14:02:36,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:02:36,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-10-14 14:02:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:36,455 INFO L225 Difference]: With dead ends: 284 [2024-10-14 14:02:36,455 INFO L226 Difference]: Without dead ends: 178 [2024-10-14 14:02:36,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:02:36,456 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 77 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:36,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 585 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:02:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-14 14:02:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2024-10-14 14:02:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 152 states have (on average 1.394736842105263) internal successors, (212), 153 states have internal predecessors, (212), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 14:02:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 252 transitions. [2024-10-14 14:02:36,485 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 252 transitions. Word has length 126 [2024-10-14 14:02:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:36,486 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 252 transitions. [2024-10-14 14:02:36,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 14:02:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 252 transitions. [2024-10-14 14:02:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 14:02:36,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:36,488 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:36,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:02:36,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:36,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:36,489 INFO L85 PathProgramCache]: Analyzing trace with hash 990181236, now seen corresponding path program 1 times [2024-10-14 14:02:36,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:36,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287774929] [2024-10-14 14:02:36,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:36,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:36,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:36,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287774929] [2024-10-14 14:02:36,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287774929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:36,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:36,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:02:36,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821596219] [2024-10-14 14:02:36,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:36,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:02:36,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:36,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:02:36,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:02:36,619 INFO L87 Difference]: Start difference. First operand 175 states and 252 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:36,657 INFO L93 Difference]: Finished difference Result 386 states and 553 transitions. [2024-10-14 14:02:36,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:02:36,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-10-14 14:02:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:36,662 INFO L225 Difference]: With dead ends: 386 [2024-10-14 14:02:36,662 INFO L226 Difference]: Without dead ends: 212 [2024-10-14 14:02:36,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:02:36,664 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 65 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:36,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 337 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:02:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-14 14:02:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 175. [2024-10-14 14:02:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 152 states have (on average 1.388157894736842) internal successors, (211), 153 states have internal predecessors, (211), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 14:02:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 251 transitions. [2024-10-14 14:02:36,678 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 251 transitions. Word has length 128 [2024-10-14 14:02:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:36,678 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 251 transitions. [2024-10-14 14:02:36,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 251 transitions. [2024-10-14 14:02:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 14:02:36,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:36,680 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:02:36,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:36,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1747220847, now seen corresponding path program 1 times [2024-10-14 14:02:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456682204] [2024-10-14 14:02:36,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:36,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:36,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:36,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456682204] [2024-10-14 14:02:36,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456682204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:36,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:36,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:02:36,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431333275] [2024-10-14 14:02:36,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:36,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:02:36,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:36,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:02:36,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:36,925 INFO L87 Difference]: Start difference. First operand 175 states and 251 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:36,972 INFO L93 Difference]: Finished difference Result 355 states and 509 transitions. [2024-10-14 14:02:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:02:36,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-10-14 14:02:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:36,976 INFO L225 Difference]: With dead ends: 355 [2024-10-14 14:02:36,976 INFO L226 Difference]: Without dead ends: 181 [2024-10-14 14:02:36,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:36,980 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:36,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 549 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:02:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-14 14:02:36,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-14 14:02:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 158 states have (on average 1.3734177215189873) internal successors, (217), 159 states have internal predecessors, (217), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 14:02:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 257 transitions. [2024-10-14 14:02:36,996 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 257 transitions. Word has length 128 [2024-10-14 14:02:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:36,996 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 257 transitions. [2024-10-14 14:02:36,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 257 transitions. [2024-10-14 14:02:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 14:02:36,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:36,998 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:36,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:02:36,999 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:36,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash -721477642, now seen corresponding path program 1 times [2024-10-14 14:02:36,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:36,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646733955] [2024-10-14 14:02:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:37,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:37,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646733955] [2024-10-14 14:02:37,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646733955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:37,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:37,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:02:37,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476919244] [2024-10-14 14:02:37,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:37,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:02:37,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:37,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:02:37,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:02:37,107 INFO L87 Difference]: Start difference. First operand 181 states and 257 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:37,139 INFO L93 Difference]: Finished difference Result 360 states and 509 transitions. [2024-10-14 14:02:37,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:02:37,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-10-14 14:02:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:37,142 INFO L225 Difference]: With dead ends: 360 [2024-10-14 14:02:37,142 INFO L226 Difference]: Without dead ends: 180 [2024-10-14 14:02:37,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:02:37,143 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 61 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:37,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 288 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:02:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-14 14:02:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2024-10-14 14:02:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 155 states have internal predecessors, (210), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 14:02:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 250 transitions. [2024-10-14 14:02:37,157 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 250 transitions. Word has length 128 [2024-10-14 14:02:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:37,157 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 250 transitions. [2024-10-14 14:02:37,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 250 transitions. [2024-10-14 14:02:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 14:02:37,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:37,159 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:37,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 14:02:37,160 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:37,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:37,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2138691333, now seen corresponding path program 1 times [2024-10-14 14:02:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:37,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186465318] [2024-10-14 14:02:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:37,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:37,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:37,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186465318] [2024-10-14 14:02:37,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186465318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:37,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:37,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:02:37,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791137326] [2024-10-14 14:02:37,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:37,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:02:37,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:02:37,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:02:37,386 INFO L87 Difference]: Start difference. First operand 177 states and 250 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:37,719 INFO L93 Difference]: Finished difference Result 521 states and 731 transitions. [2024-10-14 14:02:37,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:02:37,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-10-14 14:02:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:37,722 INFO L225 Difference]: With dead ends: 521 [2024-10-14 14:02:37,723 INFO L226 Difference]: Without dead ends: 345 [2024-10-14 14:02:37,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:37,724 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 228 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:37,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 300 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:02:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-14 14:02:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 289. [2024-10-14 14:02:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 244 states have (on average 1.3401639344262295) internal successors, (327), 246 states have internal predecessors, (327), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 14:02:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2024-10-14 14:02:37,751 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 130 [2024-10-14 14:02:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:37,751 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2024-10-14 14:02:37,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2024-10-14 14:02:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 14:02:37,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:37,753 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:37,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 14:02:37,754 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:37,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1877553814, now seen corresponding path program 1 times [2024-10-14 14:02:37,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:37,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113708403] [2024-10-14 14:02:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:37,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:37,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:37,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113708403] [2024-10-14 14:02:37,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113708403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:37,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:37,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:02:37,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878038643] [2024-10-14 14:02:37,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:37,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:02:37,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:37,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:02:37,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:02:37,903 INFO L87 Difference]: Start difference. First operand 289 states and 407 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:37,963 INFO L93 Difference]: Finished difference Result 573 states and 806 transitions. [2024-10-14 14:02:37,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:02:37,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-10-14 14:02:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:37,965 INFO L225 Difference]: With dead ends: 573 [2024-10-14 14:02:37,965 INFO L226 Difference]: Without dead ends: 293 [2024-10-14 14:02:37,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:37,968 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 58 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:37,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 411 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:02:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-14 14:02:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2024-10-14 14:02:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 246 states have (on average 1.3373983739837398) internal successors, (329), 248 states have internal predecessors, (329), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 14:02:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 409 transitions. [2024-10-14 14:02:37,993 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 409 transitions. Word has length 131 [2024-10-14 14:02:37,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:37,994 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 409 transitions. [2024-10-14 14:02:37,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 409 transitions. [2024-10-14 14:02:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 14:02:37,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:37,996 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:37,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 14:02:37,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:37,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:37,997 INFO L85 PathProgramCache]: Analyzing trace with hash 597690136, now seen corresponding path program 1 times [2024-10-14 14:02:37,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:37,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307815642] [2024-10-14 14:02:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:38,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:38,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307815642] [2024-10-14 14:02:38,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307815642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:38,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:38,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:02:38,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089806439] [2024-10-14 14:02:38,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:38,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:02:38,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:38,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:02:38,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:02:38,219 INFO L87 Difference]: Start difference. First operand 291 states and 409 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:38,283 INFO L93 Difference]: Finished difference Result 585 states and 820 transitions. [2024-10-14 14:02:38,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:02:38,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-10-14 14:02:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:38,286 INFO L225 Difference]: With dead ends: 585 [2024-10-14 14:02:38,286 INFO L226 Difference]: Without dead ends: 303 [2024-10-14 14:02:38,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:02:38,288 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:38,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:02:38,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-14 14:02:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 294. [2024-10-14 14:02:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 249 states have (on average 1.3333333333333333) internal successors, (332), 251 states have internal predecessors, (332), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 14:02:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 412 transitions. [2024-10-14 14:02:38,311 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 412 transitions. Word has length 131 [2024-10-14 14:02:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:38,312 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 412 transitions. [2024-10-14 14:02:38,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 412 transitions. [2024-10-14 14:02:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 14:02:38,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:38,314 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:38,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 14:02:38,314 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:38,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:38,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2018639566, now seen corresponding path program 1 times [2024-10-14 14:02:38,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:38,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502833451] [2024-10-14 14:02:38,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:38,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:38,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:38,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502833451] [2024-10-14 14:02:38,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502833451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:38,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:38,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:02:38,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357163713] [2024-10-14 14:02:38,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:38,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:02:38,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:38,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:02:38,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:38,504 INFO L87 Difference]: Start difference. First operand 294 states and 412 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:38,890 INFO L93 Difference]: Finished difference Result 622 states and 876 transitions. [2024-10-14 14:02:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:02:38,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-10-14 14:02:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:38,895 INFO L225 Difference]: With dead ends: 622 [2024-10-14 14:02:38,896 INFO L226 Difference]: Without dead ends: 337 [2024-10-14 14:02:38,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:02:38,897 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 118 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:38,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 459 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:02:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-14 14:02:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 326. [2024-10-14 14:02:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 268 states have (on average 1.3097014925373134) internal successors, (351), 270 states have internal predecessors, (351), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 14:02:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 455 transitions. [2024-10-14 14:02:38,931 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 455 transitions. Word has length 132 [2024-10-14 14:02:38,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:38,932 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 455 transitions. [2024-10-14 14:02:38,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 455 transitions. [2024-10-14 14:02:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 14:02:38,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:38,934 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:38,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 14:02:38,935 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:38,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:38,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1431833552, now seen corresponding path program 1 times [2024-10-14 14:02:38,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:38,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205926699] [2024-10-14 14:02:38,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:38,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:02:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:02:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:02:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:02:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:02:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:02:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:02:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:02:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:02:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:02:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:02:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:02:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 14:02:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:02:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:02:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:02:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:02:39,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205926699] [2024-10-14 14:02:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205926699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:39,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:39,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:02:39,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822666665] [2024-10-14 14:02:39,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:39,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:02:39,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:02:39,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:02:39,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:39,370 INFO L87 Difference]: Start difference. First operand 326 states and 455 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:39,630 INFO L93 Difference]: Finished difference Result 342 states and 471 transitions. [2024-10-14 14:02:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:02:39,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-10-14 14:02:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:39,633 INFO L225 Difference]: With dead ends: 342 [2024-10-14 14:02:39,633 INFO L226 Difference]: Without dead ends: 340 [2024-10-14 14:02:39,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:02:39,634 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 91 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:39,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 501 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:02:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-14 14:02:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2024-10-14 14:02:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 280 states have (on average 1.2964285714285715) internal successors, (363), 282 states have internal predecessors, (363), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 14:02:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 467 transitions. [2024-10-14 14:02:39,662 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 467 transitions. Word has length 132 [2024-10-14 14:02:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:39,663 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 467 transitions. [2024-10-14 14:02:39,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 467 transitions. [2024-10-14 14:02:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 14:02:39,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:39,665 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:39,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 14:02:39,665 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:39,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1431893134, now seen corresponding path program 1 times [2024-10-14 14:02:39,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:02:39,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839765150] [2024-10-14 14:02:39,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:39,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:02:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:02:39,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 14:02:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:02:39,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 14:02:39,879 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 14:02:39,881 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 14:02:39,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 14:02:39,885 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:39,969 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 14:02:39,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:02:39 BoogieIcfgContainer [2024-10-14 14:02:39,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 14:02:39,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 14:02:39,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 14:02:39,973 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 14:02:39,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:02:31" (3/4) ... [2024-10-14 14:02:39,976 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 14:02:39,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 14:02:39,977 INFO L158 Benchmark]: Toolchain (without parser) took 9367.53ms. Allocated memory was 148.9MB in the beginning and 323.0MB in the end (delta: 174.1MB). Free memory was 118.5MB in the beginning and 121.5MB in the end (delta: -3.0MB). Peak memory consumption was 171.9MB. Max. memory is 16.1GB. [2024-10-14 14:02:39,978 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 148.9MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:02:39,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.17ms. Allocated memory is still 148.9MB. Free memory was 118.5MB in the beginning and 101.5MB in the end (delta: 17.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 14:02:39,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.52ms. Allocated memory is still 148.9MB. Free memory was 101.0MB in the beginning and 96.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 14:02:39,979 INFO L158 Benchmark]: Boogie Preprocessor took 113.15ms. Allocated memory is still 148.9MB. Free memory was 96.8MB in the beginning and 92.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 14:02:39,979 INFO L158 Benchmark]: RCFGBuilder took 777.06ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 92.2MB in the beginning and 140.6MB in the end (delta: -48.4MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2024-10-14 14:02:39,980 INFO L158 Benchmark]: TraceAbstraction took 8019.00ms. Allocated memory was 180.4MB in the beginning and 323.0MB in the end (delta: 142.6MB). Free memory was 139.6MB in the beginning and 122.5MB in the end (delta: 17.1MB). Peak memory consumption was 161.6MB. Max. memory is 16.1GB. [2024-10-14 14:02:39,980 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 323.0MB. Free memory was 122.5MB in the beginning and 121.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:02:39,985 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.19ms. Allocated memory is still 148.9MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.17ms. Allocated memory is still 148.9MB. Free memory was 118.5MB in the beginning and 101.5MB in the end (delta: 17.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.52ms. Allocated memory is still 148.9MB. Free memory was 101.0MB in the beginning and 96.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.15ms. Allocated memory is still 148.9MB. Free memory was 96.8MB in the beginning and 92.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 777.06ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 92.2MB in the beginning and 140.6MB in the end (delta: -48.4MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8019.00ms. Allocated memory was 180.4MB in the beginning and 323.0MB in the end (delta: 142.6MB). Free memory was 139.6MB in the beginning and 122.5MB in the end (delta: 17.1MB). Peak memory consumption was 161.6MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 323.0MB. Free memory was 122.5MB in the beginning and 121.5MB in the end (delta: 1.0MB). 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 109, overapproximation of someBinaryFLOATComparisonOperation at line 118. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L57] unsigned char last_1_WrapperStruct00_var_1_5 = 1; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L115] EXPR WrapperStruct00.var_1_5 [L115] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L91] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L94] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L95] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L96] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L97] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L100] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L103] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L106] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_13 [L107] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_13 [L107] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_14 [L109] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L109] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_14 [L109] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L109] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L109] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L110] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L111] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L112] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L126] RET updateVariables() [L127] CALL step() [L61] COND FALSE !(! last_1_WrapperStruct00_var_1_5) [L64] EXPR WrapperStruct00.var_1_4 [L64] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_4 [L66] EXPR WrapperStruct00.var_1_6 [L66] unsigned char stepLocal_0 = WrapperStruct00.var_1_6; [L67] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L67] COND FALSE !(WrapperStruct00.var_1_2) [L76] EXPR WrapperStruct00.var_1_1 [L76] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_1 [L77] EXPR WrapperStruct00.var_1_13 [L77] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_13 [L78] EXPR WrapperStruct00.var_1_18 [L78] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L79] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L79] EXPR WrapperStruct00.var_1_15 [L79] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L79] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L79] COND FALSE !(((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR (! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) [L118] EXPR WrapperStruct00.var_1_1 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR (! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1) [L118] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1 [L118] EXPR WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1) [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L118] EXPR WrapperStruct00.var_1_15 [L118] EXPR ((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1 [L118] EXPR (((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR (((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1)) [L118] EXPR WrapperStruct00.var_1_15 [L118] EXPR WrapperStruct00.var_1_1 [L118] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_13)) [L118] EXPR WrapperStruct00.var_1_16 [L118] EXPR WrapperStruct00.var_1_13 [L118] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_13))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] EXPR ((((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_13))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118-L119] return ((((((! last_1_WrapperStruct00_var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_1 == ((unsigned short int) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_6 && ((WrapperStruct00.var_1_3 >= 16) || last_1_WrapperStruct00_var_1_5)) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_1) && WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_5 == ((unsigned char) WrapperStruct00.var_1_10))) : 1) : 1)) && ((((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) > WrapperStruct00.var_1_15) ? (((WrapperStruct00.var_1_15 / -5) >= ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_15) - ((((WrapperStruct00.var_1_1) < (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_1) : (WrapperStruct00.var_1_3))))) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_15 == ((signed long int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_16 == ((float) WrapperStruct00.var_1_13))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 15, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 703 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 702 mSDsluCounter, 5927 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3912 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1359 IncrementalHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 2015 mSDtfsCounter, 1359 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 545 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=14, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 124 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1928 NumberOfCodeBlocks, 1928 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1782 ConstructedInterpolants, 0 QuantifiedInterpolants, 3087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6720/6720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 14:02:40,025 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-96.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 d3e0774e78cf4ed6ba09a877be2127aeb0fe9129940fc78943597bbe0bd3d6c8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:02:42,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:02:42,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 14:02:42,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:02:42,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:02:42,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:02:42,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:02:42,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:02:42,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:02:42,397 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:02:42,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:02:42,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:02:42,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:02:42,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:02:42,399 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:02:42,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:02:42,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:02:42,400 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:02:42,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:02:42,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:02:42,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:02:42,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:02:42,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:02:42,402 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 14:02:42,403 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 14:02:42,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:02:42,403 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 14:02:42,404 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:02:42,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:02:42,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:02:42,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:02:42,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:02:42,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:02:42,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:02:42,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:02:42,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:02:42,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:02:42,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:02:42,407 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 14:02:42,407 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 14:02:42,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:02:42,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:02:42,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:02:42,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:02:42,411 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 14:02:42,411 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 -> d3e0774e78cf4ed6ba09a877be2127aeb0fe9129940fc78943597bbe0bd3d6c8 [2024-10-14 14:02:42,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:02:42,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:02:42,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:02:42,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:02:42,788 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:02:42,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i [2024-10-14 14:02:44,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:02:44,665 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:02:44,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-96.i [2024-10-14 14:02:44,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f65344c/17003335e6b44bafa7ece7fd83bde4a5/FLAG7e7a2d278 [2024-10-14 14:02:44,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f65344c/17003335e6b44bafa7ece7fd83bde4a5 [2024-10-14 14:02:44,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:02:44,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:02:44,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:02:44,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:02:44,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:02:44,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:02:44" (1/1) ... [2024-10-14 14:02:44,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16064036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:44, skipping insertion in model container [2024-10-14 14:02:44,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:02:44" (1/1) ... [2024-10-14 14:02:44,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:02:44,915 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-96.i[916,929] [2024-10-14 14:02:44,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:02:45,021 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:02:45,033 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-96.i[916,929] [2024-10-14 14:02:45,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:02:45,131 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:02:45,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45 WrapperNode [2024-10-14 14:02:45,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:02:45,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:02:45,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:02:45,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:02:45,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (1/1) ... [2024-10-14 14:02:45,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (1/1) ... [2024-10-14 14:02:45,220 INFO L138 Inliner]: procedures = 39, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-10-14 14:02:45,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:02:45,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:02:45,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:02:45,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:02:45,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (1/1) ... [2024-10-14 14:02:45,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (1/1) ... [2024-10-14 14:02:45,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (1/1) ... [2024-10-14 14:02:45,279 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 18 writes are split as follows [0, 18]. [2024-10-14 14:02:45,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (1/1) ... [2024-10-14 14:02:45,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (1/1) ... [2024-10-14 14:02:45,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (1/1) ... [2024-10-14 14:02:45,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (1/1) ... [2024-10-14 14:02:45,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (1/1) ... [2024-10-14 14:02:45,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (1/1) ... [2024-10-14 14:02:45,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:02:45,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:02:45,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:02:45,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:02:45,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (1/1) ... [2024-10-14 14:02:45,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:02:45,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:02:45,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:02:45,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:02:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:02:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-14 14:02:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-14 14:02:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-14 14:02:45,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-14 14:02:45,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 14:02:45,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 14:02:45,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-14 14:02:45,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-14 14:02:45,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 14:02:45,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 14:02:45,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-14 14:02:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-14 14:02:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 14:02:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 14:02:45,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-14 14:02:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-14 14:02:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 14:02:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 14:02:45,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-14 14:02:45,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-14 14:02:45,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 14:02:45,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 14:02:45,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-14 14:02:45,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-14 14:02:45,447 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:02:45,447 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:02:45,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:02:45,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:02:45,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 14:02:45,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 14:02:45,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-14 14:02:45,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-14 14:02:45,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 14:02:45,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 14:02:45,598 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:02:45,600 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:02:46,819 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-10-14 14:02:46,819 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:02:46,863 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:02:46,863 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:02:46,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:02:46 BoogieIcfgContainer [2024-10-14 14:02:46,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:02:46,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:02:46,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:02:46,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:02:46,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:02:44" (1/3) ... [2024-10-14 14:02:46,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1127194d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:02:46, skipping insertion in model container [2024-10-14 14:02:46,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:45" (2/3) ... [2024-10-14 14:02:46,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1127194d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:02:46, skipping insertion in model container [2024-10-14 14:02:46,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:02:46" (3/3) ... [2024-10-14 14:02:46,874 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-96.i [2024-10-14 14:02:46,893 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:02:46,893 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:02:46,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:02:46,981 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;@333ba0dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:02:46,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:02:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 14:02:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:02:47,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:47,004 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:47,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:47,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1451166317, now seen corresponding path program 1 times [2024-10-14 14:02:47,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:47,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407134019] [2024-10-14 14:02:47,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:47,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:47,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:47,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:02:47,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 14:02:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:47,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 14:02:47,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-10-14 14:02:47,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:02:47,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:47,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407134019] [2024-10-14 14:02:47,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407134019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:47,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:47,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:02:47,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71048736] [2024-10-14 14:02:47,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:47,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:02:47,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:47,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:02:47,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:02:47,503 INFO L87 Difference]: Start difference. First operand has 101 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 14:02:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:47,558 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2024-10-14 14:02:47,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:02:47,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-10-14 14:02:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:47,572 INFO L225 Difference]: With dead ends: 199 [2024-10-14 14:02:47,573 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 14:02:47,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:02:47,582 INFO L432 NwaCegarLoop]: 143 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, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:47,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:02:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 14:02:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-14 14:02:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 14:02:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 147 transitions. [2024-10-14 14:02:47,631 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 147 transitions. Word has length 126 [2024-10-14 14:02:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:47,632 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 147 transitions. [2024-10-14 14:02:47,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 14:02:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 147 transitions. [2024-10-14 14:02:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:02:47,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:47,638 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:47,649 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 (2)] Forceful destruction successful, exit code 0 [2024-10-14 14:02:47,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:47,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:47,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:47,844 INFO L85 PathProgramCache]: Analyzing trace with hash 493140279, now seen corresponding path program 1 times [2024-10-14 14:02:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:47,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855190249] [2024-10-14 14:02:47,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:47,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:47,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:47,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:02:47,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 14:02:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:48,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 14:02:48,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:48,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:02:48,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:48,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855190249] [2024-10-14 14:02:48,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855190249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:48,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:48,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:02:48,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351258180] [2024-10-14 14:02:48,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:48,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:02:48,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:48,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:02:48,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:48,214 INFO L87 Difference]: Start difference. First operand 99 states and 147 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:48,324 INFO L93 Difference]: Finished difference Result 202 states and 300 transitions. [2024-10-14 14:02:48,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:02:48,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 14:02:48,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:48,329 INFO L225 Difference]: With dead ends: 202 [2024-10-14 14:02:48,329 INFO L226 Difference]: Without dead ends: 104 [2024-10-14 14:02:48,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:48,333 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:48,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 542 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:02:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-14 14:02:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-14 14:02:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.4) internal successors, (119), 85 states have internal predecessors, (119), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 14:02:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2024-10-14 14:02:48,344 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 126 [2024-10-14 14:02:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:48,346 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2024-10-14 14:02:48,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2024-10-14 14:02:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:02:48,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:48,353 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:48,376 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-14 14:02:48,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:48,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:48,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:48,555 INFO L85 PathProgramCache]: Analyzing trace with hash -316206347, now seen corresponding path program 1 times [2024-10-14 14:02:48,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:48,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527899253] [2024-10-14 14:02:48,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:48,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:48,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:48,560 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:02:48,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 14:02:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:48,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 14:02:48,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:48,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:02:48,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:48,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527899253] [2024-10-14 14:02:48,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527899253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:48,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:48,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:02:48,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12769795] [2024-10-14 14:02:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:48,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:02:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:48,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:02:48,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:02:48,911 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:49,174 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2024-10-14 14:02:49,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:02:49,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 14:02:49,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:49,177 INFO L225 Difference]: With dead ends: 208 [2024-10-14 14:02:49,177 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 14:02:49,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:02:49,179 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:49,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 668 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:02:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 14:02:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-14 14:02:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 87 states have internal predecessors, (121), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 14:02:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-10-14 14:02:49,190 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 126 [2024-10-14 14:02:49,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:49,191 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-10-14 14:02:49,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:49,191 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-10-14 14:02:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:02:49,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:49,193 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:49,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 14:02:49,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:49,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:49,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash -258948045, now seen corresponding path program 1 times [2024-10-14 14:02:49,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:49,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917186043] [2024-10-14 14:02:49,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:49,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:49,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:02:49,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 14:02:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:49,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 14:02:49,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:49,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:02:49,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:49,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917186043] [2024-10-14 14:02:49,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917186043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:49,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:49,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:02:49,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409865024] [2024-10-14 14:02:49,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:49,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:02:49,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:49,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:02:49,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:02:49,703 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:49,951 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2024-10-14 14:02:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:02:49,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 14:02:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:49,954 INFO L225 Difference]: With dead ends: 212 [2024-10-14 14:02:49,954 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 14:02:49,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 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-14 14:02:49,956 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:49,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 796 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:02:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 14:02:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-14 14:02:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 89 states have internal predecessors, (123), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 14:02:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-10-14 14:02:49,967 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 126 [2024-10-14 14:02:49,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:49,968 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-10-14 14:02:49,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-10-14 14:02:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:02:49,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:49,971 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:49,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 14:02:50,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:50,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:50,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash -258888463, now seen corresponding path program 1 times [2024-10-14 14:02:50,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:50,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926416078] [2024-10-14 14:02:50,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:50,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:50,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:50,178 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:02:50,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 14:02:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:50,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 14:02:50,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:50,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-10-14 14:02:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:50,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:02:50,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:50,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926416078] [2024-10-14 14:02:50,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926416078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:50,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:50,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:02:50,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672056312] [2024-10-14 14:02:50,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:50,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:02:50,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:50,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:02:50,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:02:50,633 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:50,684 INFO L93 Difference]: Finished difference Result 213 states and 309 transitions. [2024-10-14 14:02:50,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:02:50,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-10-14 14:02:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:50,686 INFO L225 Difference]: With dead ends: 213 [2024-10-14 14:02:50,686 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 14:02:50,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:02:50,691 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:50,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:02:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 14:02:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-14 14:02:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 89 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 14:02:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2024-10-14 14:02:50,707 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 126 [2024-10-14 14:02:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:50,708 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2024-10-14 14:02:50,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2024-10-14 14:02:50,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:02:50,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:50,711 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:50,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 14:02:50,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:50,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:50,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:50,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2041934127, now seen corresponding path program 1 times [2024-10-14 14:02:50,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:50,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352463488] [2024-10-14 14:02:50,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:50,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:50,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:50,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:02:50,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 14:02:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:51,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 14:02:51,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:51,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 14:02:51,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 14:02:51,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 14:02:51,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 14:02:51,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2024-10-14 14:02:51,314 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 30 treesize of output 1 [2024-10-14 14:02:51,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-14 14:02:51,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:51,436 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 30 treesize of output 32 [2024-10-14 14:02:51,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:51,513 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 67 treesize of output 46 [2024-10-14 14:02:51,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:02:51,699 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 89 treesize of output 41 [2024-10-14 14:02:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-10-14 14:02:51,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:02:51,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:51,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352463488] [2024-10-14 14:02:51,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352463488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:51,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:51,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:02:51,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916643174] [2024-10-14 14:02:51,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:51,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:02:51,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:51,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:02:51,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:02:51,737 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 14:02:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:54,481 INFO L93 Difference]: Finished difference Result 284 states and 406 transitions. [2024-10-14 14:02:54,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:02:54,482 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), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-10-14 14:02:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:54,484 INFO L225 Difference]: With dead ends: 284 [2024-10-14 14:02:54,484 INFO L226 Difference]: Without dead ends: 178 [2024-10-14 14:02:54,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:02:54,486 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 303 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:54,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 346 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 14:02:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-14 14:02:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2024-10-14 14:02:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 152 states have (on average 1.381578947368421) internal successors, (210), 153 states have internal predecessors, (210), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 14:02:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 250 transitions. [2024-10-14 14:02:54,511 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 250 transitions. Word has length 126 [2024-10-14 14:02:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:54,512 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 250 transitions. [2024-10-14 14:02:54,512 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), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 14:02:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 250 transitions. [2024-10-14 14:02:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 14:02:54,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:54,514 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:54,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 14:02:54,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:54,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:54,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash 990181236, now seen corresponding path program 1 times [2024-10-14 14:02:54,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:54,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380707282] [2024-10-14 14:02:54,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:54,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:54,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:54,719 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:02:54,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 14:02:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:54,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 14:02:54,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:54,965 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-14 14:02:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:55,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:02:55,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:55,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380707282] [2024-10-14 14:02:55,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380707282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:55,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:55,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:02:55,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362288197] [2024-10-14 14:02:55,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:55,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:02:55,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:55,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:02:55,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:02:55,215 INFO L87 Difference]: Start difference. First operand 175 states and 250 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:56,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:56,974 INFO L93 Difference]: Finished difference Result 507 states and 721 transitions. [2024-10-14 14:02:56,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:02:56,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-10-14 14:02:56,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:56,979 INFO L225 Difference]: With dead ends: 507 [2024-10-14 14:02:56,979 INFO L226 Difference]: Without dead ends: 333 [2024-10-14 14:02:56,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:56,980 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 222 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:56,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 299 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 14:02:56,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-14 14:02:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 293. [2024-10-14 14:02:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 248 states have (on average 1.3588709677419355) internal successors, (337), 250 states have internal predecessors, (337), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 14:02:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 417 transitions. [2024-10-14 14:02:57,011 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 417 transitions. Word has length 128 [2024-10-14 14:02:57,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:57,012 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 417 transitions. [2024-10-14 14:02:57,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 417 transitions. [2024-10-14 14:02:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 14:02:57,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:57,014 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:57,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-14 14:02:57,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:57,215 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:57,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1747220847, now seen corresponding path program 1 times [2024-10-14 14:02:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142095825] [2024-10-14 14:02:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:57,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:57,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:57,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:02:57,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 14:02:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:57,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 14:02:57,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:57,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:02:57,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:57,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142095825] [2024-10-14 14:02:57,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142095825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:57,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:57,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:02:57,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943881292] [2024-10-14 14:02:57,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:57,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:02:57,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:57,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:02:57,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:57,508 INFO L87 Difference]: Start difference. First operand 293 states and 417 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:02:57,587 INFO L93 Difference]: Finished difference Result 586 states and 833 transitions. [2024-10-14 14:02:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:02:57,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-10-14 14:02:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:02:57,590 INFO L225 Difference]: With dead ends: 586 [2024-10-14 14:02:57,590 INFO L226 Difference]: Without dead ends: 302 [2024-10-14 14:02:57,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:57,592 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:02:57,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:02:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-14 14:02:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-10-14 14:02:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 257 states have (on average 1.3463035019455254) internal successors, (346), 259 states have internal predecessors, (346), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 14:02:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 426 transitions. [2024-10-14 14:02:57,653 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 426 transitions. Word has length 128 [2024-10-14 14:02:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:02:57,653 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 426 transitions. [2024-10-14 14:02:57,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:02:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 426 transitions. [2024-10-14 14:02:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 14:02:57,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:02:57,655 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:02:57,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 14:02:57,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:57,857 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:02:57,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:02:57,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1877553814, now seen corresponding path program 1 times [2024-10-14 14:02:57,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:02:57,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912782521] [2024-10-14 14:02:57,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:02:57,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:02:57,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:02:57,860 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:02:57,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 14:02:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:02:58,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 14:02:58,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:02:58,109 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-14 14:02:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:02:58,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:02:58,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:02:58,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912782521] [2024-10-14 14:02:58,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912782521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:02:58,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:02:58,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:02:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024713345] [2024-10-14 14:02:58,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:02:58,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:02:58,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:02:58,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:02:58,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:02:58,361 INFO L87 Difference]: Start difference. First operand 302 states and 426 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:03:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:03:00,356 INFO L93 Difference]: Finished difference Result 640 states and 898 transitions. [2024-10-14 14:03:00,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:03:00,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-10-14 14:03:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:03:00,359 INFO L225 Difference]: With dead ends: 640 [2024-10-14 14:03:00,359 INFO L226 Difference]: Without dead ends: 347 [2024-10-14 14:03:00,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:03:00,365 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 204 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 14:03:00,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 381 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 14:03:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-14 14:03:00,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 308. [2024-10-14 14:03:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 263 states have (on average 1.3460076045627376) internal successors, (354), 265 states have internal predecessors, (354), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 14:03:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 434 transitions. [2024-10-14 14:03:00,389 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 434 transitions. Word has length 131 [2024-10-14 14:03:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:03:00,389 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 434 transitions. [2024-10-14 14:03:00,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:03:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 434 transitions. [2024-10-14 14:03:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 14:03:00,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:03:00,391 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:03:00,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 14:03:00,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:03:00,592 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:03:00,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:03:00,592 INFO L85 PathProgramCache]: Analyzing trace with hash 597690136, now seen corresponding path program 1 times [2024-10-14 14:03:00,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:03:00,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940491298] [2024-10-14 14:03:00,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:03:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:03:00,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:03:00,596 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:03:00,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 14:03:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:03:00,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 14:03:00,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:03:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:03:00,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:03:00,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:03:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940491298] [2024-10-14 14:03:00,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940491298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:03:00,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:03:00,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:03:00,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931656994] [2024-10-14 14:03:00,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:03:00,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:03:00,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:03:00,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:03:00,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:03:00,840 INFO L87 Difference]: Start difference. First operand 308 states and 434 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:03:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:03:00,928 INFO L93 Difference]: Finished difference Result 619 states and 870 transitions. [2024-10-14 14:03:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:03:00,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-10-14 14:03:00,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:03:00,932 INFO L225 Difference]: With dead ends: 619 [2024-10-14 14:03:00,932 INFO L226 Difference]: Without dead ends: 320 [2024-10-14 14:03:00,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:03:00,934 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:03:00,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 677 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:03:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-14 14:03:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 311. [2024-10-14 14:03:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 266 states have (on average 1.3421052631578947) internal successors, (357), 268 states have internal predecessors, (357), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 14:03:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 437 transitions. [2024-10-14 14:03:00,974 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 437 transitions. Word has length 131 [2024-10-14 14:03:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:03:00,975 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 437 transitions. [2024-10-14 14:03:00,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:03:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 437 transitions. [2024-10-14 14:03:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 14:03:00,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:03:00,976 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:03:00,987 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 (11)] Forceful destruction successful, exit code 0 [2024-10-14 14:03:01,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:03:01,177 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:03:01,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:03:01,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2018639566, now seen corresponding path program 1 times [2024-10-14 14:03:01,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:03:01,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470484824] [2024-10-14 14:03:01,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:03:01,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:03:01,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:03:01,180 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:03:01,181 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 (12)] Waiting until timeout for monitored process [2024-10-14 14:03:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:03:01,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 14:03:01,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:03:01,479 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 20 treesize of output 8 [2024-10-14 14:03:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:03:01,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:03:01,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:03:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470484824] [2024-10-14 14:03:01,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470484824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:03:01,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:03:01,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:03:01,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393458961] [2024-10-14 14:03:01,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:03:01,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:03:01,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:03:01,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:03:01,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:03:01,492 INFO L87 Difference]: Start difference. First operand 311 states and 437 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:03:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:03:02,658 INFO L93 Difference]: Finished difference Result 662 states and 932 transitions. [2024-10-14 14:03:02,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:03:02,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-10-14 14:03:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:03:02,662 INFO L225 Difference]: With dead ends: 662 [2024-10-14 14:03:02,662 INFO L226 Difference]: Without dead ends: 360 [2024-10-14 14:03:02,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:03:02,663 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 118 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:03:02,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 459 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 14:03:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-14 14:03:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 349. [2024-10-14 14:03:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 291 states have (on average 1.3230240549828178) internal successors, (385), 293 states have internal predecessors, (385), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 14:03:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 489 transitions. [2024-10-14 14:03:02,703 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 489 transitions. Word has length 132 [2024-10-14 14:03:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:03:02,703 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 489 transitions. [2024-10-14 14:03:02,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:03:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 489 transitions. [2024-10-14 14:03:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 14:03:02,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:03:02,706 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:03:02,715 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 (12)] Ended with exit code 0 [2024-10-14 14:03:02,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:03:02,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:03:02,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:03:02,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1431833552, now seen corresponding path program 1 times [2024-10-14 14:03:02,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:03:02,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314946419] [2024-10-14 14:03:02,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:03:02,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:03:02,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:03:02,909 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:03:02,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 14:03:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:03:03,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 14:03:03,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:03:03,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 14:03:03,263 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 19 treesize of output 19 [2024-10-14 14:03:03,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:03:03,286 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 53 [2024-10-14 14:03:03,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:03:03,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 37 [2024-10-14 14:03:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 14:03:03,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:03:03,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:03:03,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314946419] [2024-10-14 14:03:03,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314946419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:03:03,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:03:03,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:03:03,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807891285] [2024-10-14 14:03:03,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:03:03,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:03:03,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:03:03,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:03:03,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:03:03,681 INFO L87 Difference]: Start difference. First operand 349 states and 489 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:03:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:03:06,194 INFO L93 Difference]: Finished difference Result 358 states and 498 transitions. [2024-10-14 14:03:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:03:06,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-10-14 14:03:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:03:06,197 INFO L225 Difference]: With dead ends: 358 [2024-10-14 14:03:06,197 INFO L226 Difference]: Without dead ends: 356 [2024-10-14 14:03:06,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:03:06,198 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 102 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:03:06,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 423 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 14:03:06,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-14 14:03:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 353. [2024-10-14 14:03:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 295 states have (on average 1.3186440677966103) internal successors, (389), 297 states have internal predecessors, (389), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 14:03:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 493 transitions. [2024-10-14 14:03:06,255 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 493 transitions. Word has length 132 [2024-10-14 14:03:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:03:06,256 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 493 transitions. [2024-10-14 14:03:06,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 14:03:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 493 transitions. [2024-10-14 14:03:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 14:03:06,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:03:06,257 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:03:06,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 14:03:06,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:03:06,458 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:03:06,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:03:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1431893134, now seen corresponding path program 1 times [2024-10-14 14:03:06,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:03:06,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614767269] [2024-10-14 14:03:06,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:03:06,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:03:06,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:03:06,460 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:03:06,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 14:03:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:03:06,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 14:03:06,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:03:07,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 14:03:07,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:03:07,544 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 133 treesize of output 79 [2024-10-14 14:03:11,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:03:11,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 85 [2024-10-14 14:03:12,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:03:12,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 103 [2024-10-14 14:03:12,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:03:12,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 266 treesize of output 158 [2024-10-14 14:03:31,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:03:31,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 401 treesize of output 135 [2024-10-14 14:03:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-14 14:03:31,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:03:31,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:03:31,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614767269] [2024-10-14 14:03:31,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614767269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:03:31,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:03:31,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 14:03:31,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011770625] [2024-10-14 14:03:31,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:03:31,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 14:03:31,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:03:31,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 14:03:31,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=97, Unknown=1, NotChecked=0, Total=132 [2024-10-14 14:03:31,932 INFO L87 Difference]: Start difference. First operand 353 states and 493 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-14 14:03:36,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:03:44,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:03:48,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:03:50,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:03:54,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]