./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:06:46,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:06:46,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:06:46,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:06:46,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:06:46,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:06:46,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:06:46,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:06:46,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:06:46,419 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:06:46,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:06:46,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:06:46,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:06:46,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:06:46,420 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:06:46,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:06:46,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:06:46,420 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:06:46,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:06:46,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:06:46,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:06:46,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:06:46,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:06:46,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:06:46,421 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:06:46,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:06:46,421 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:06:46,421 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:06:46,421 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:06:46,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:06:46,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:06:46,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:06:46,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:06:46,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:06:46,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:06:46,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:06:46,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:06:46,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:06:46,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:06:46,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:06:46,422 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:06:46,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:06:46,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:06:46,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:06:46,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:06:46,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:06:46,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:06:46,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:06:46,423 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d [2025-01-09 16:06:46,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:06:46,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:06:46,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:06:46,703 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:06:46,703 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:06:46,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i [2025-01-09 16:06:48,077 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc2473afa/b82e25ca1f284a2b97d81390f53394b7/FLAG37dbbd7c7 [2025-01-09 16:06:48,355 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:06:48,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i [2025-01-09 16:06:48,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc2473afa/b82e25ca1f284a2b97d81390f53394b7/FLAG37dbbd7c7 [2025-01-09 16:06:48,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc2473afa/b82e25ca1f284a2b97d81390f53394b7 [2025-01-09 16:06:48,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:06:48,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:06:48,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:06:48,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:06:48,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:06:48,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c29319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48, skipping insertion in model container [2025-01-09 16:06:48,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:06:48,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i[917,930] [2025-01-09 16:06:48,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:06:48,629 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:06:48,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i[917,930] [2025-01-09 16:06:48,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:06:48,696 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:06:48,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48 WrapperNode [2025-01-09 16:06:48,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:06:48,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:06:48,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:06:48,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:06:48,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,761 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2025-01-09 16:06:48,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:06:48,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:06:48,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:06:48,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:06:48,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,780 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:06:48,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,798 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:06:48,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:06:48,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:06:48,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:06:48,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (1/1) ... [2025-01-09 16:06:48,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:06:48,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:06:48,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:06:48,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:06:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:06:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:06:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:06:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:06:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:06:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:06:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:06:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:06:48,877 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:06:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:06:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:06:48,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:06:49,000 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:06:49,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:06:49,518 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-09 16:06:49,518 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:06:49,530 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:06:49,530 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:06:49,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:06:49 BoogieIcfgContainer [2025-01-09 16:06:49,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:06:49,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:06:49,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:06:49,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:06:49,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:06:48" (1/3) ... [2025-01-09 16:06:49,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7097aaef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:06:49, skipping insertion in model container [2025-01-09 16:06:49,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:06:48" (2/3) ... [2025-01-09 16:06:49,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7097aaef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:06:49, skipping insertion in model container [2025-01-09 16:06:49,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:06:49" (3/3) ... [2025-01-09 16:06:49,543 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-15.i [2025-01-09 16:06:49,556 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:06:49,558 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-15.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:06:49,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:06:49,629 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;@74d76196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:06:49,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:06:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:06:49,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:06:49,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:49,650 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:49,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:49,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1053157755, now seen corresponding path program 1 times [2025-01-09 16:06:49,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:06:49,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131114369] [2025-01-09 16:06:49,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:06:49,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:06:49,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:06:49,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:49,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 16:06:50,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:06:50,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131114369] [2025-01-09 16:06:50,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131114369] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:06:50,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141247966] [2025-01-09 16:06:50,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:50,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:06:50,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:06:50,011 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:06:50,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:06:50,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:06:50,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:06:50,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:50,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:50,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:06:50,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 16:06:50,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:50,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141247966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:50,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:06:50,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:06:50,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570917784] [2025-01-09 16:06:50,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:50,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:06:50,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:06:50,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:06:50,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:06:50,379 INFO L87 Difference]: Start difference. First operand has 112 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:06:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:50,400 INFO L93 Difference]: Finished difference Result 218 states and 335 transitions. [2025-01-09 16:06:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:06:50,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-01-09 16:06:50,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:50,408 INFO L225 Difference]: With dead ends: 218 [2025-01-09 16:06:50,408 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 16:06:50,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:06:50,416 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:50,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:06:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 16:06:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 16:06:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:06:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-01-09 16:06:50,458 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2025-01-09 16:06:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:50,459 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-01-09 16:06:50,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:06:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-01-09 16:06:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:06:50,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:50,462 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:50,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:06:50,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 16:06:50,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:50,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash -95552011, now seen corresponding path program 1 times [2025-01-09 16:06:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:06:50,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402337482] [2025-01-09 16:06:50,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:06:50,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:06:50,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:06:50,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:50,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:06:50,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:06:50,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402337482] [2025-01-09 16:06:50,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402337482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:50,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:50,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:06:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890635203] [2025-01-09 16:06:50,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:50,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:06:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:06:50,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:06:50,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:06:50,927 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:06:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:50,962 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2025-01-09 16:06:50,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:06:50,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-01-09 16:06:50,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:50,965 INFO L225 Difference]: With dead ends: 216 [2025-01-09 16:06:50,965 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 16:06:50,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:06:50,966 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:50,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:06:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 16:06:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 16:06:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:06:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2025-01-09 16:06:50,981 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 115 [2025-01-09 16:06:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:50,983 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2025-01-09 16:06:50,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:06:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2025-01-09 16:06:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:06:50,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:50,988 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:50,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:06:50,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:50,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1784495753, now seen corresponding path program 1 times [2025-01-09 16:06:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:06:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208875853] [2025-01-09 16:06:50,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:06:51,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:06:51,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:06:51,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:51,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:06:51,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:06:51,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208875853] [2025-01-09 16:06:51,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208875853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:51,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:51,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:06:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488346197] [2025-01-09 16:06:51,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:51,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:06:51,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:06:51,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:06:51,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:06:51,325 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:06:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:51,375 INFO L93 Difference]: Finished difference Result 219 states and 316 transitions. [2025-01-09 16:06:51,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:06:51,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-01-09 16:06:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:51,380 INFO L225 Difference]: With dead ends: 219 [2025-01-09 16:06:51,381 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 16:06:51,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:06:51,382 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:51,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:06:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 16:06:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 16:06:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:06:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2025-01-09 16:06:51,392 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 115 [2025-01-09 16:06:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:51,393 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2025-01-09 16:06:51,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:06:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2025-01-09 16:06:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:06:51,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:51,395 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:51,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:06:51,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:51,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:51,396 INFO L85 PathProgramCache]: Analyzing trace with hash -940490251, now seen corresponding path program 1 times [2025-01-09 16:06:51,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:06:51,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543592194] [2025-01-09 16:06:51,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:51,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:06:51,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:06:51,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:06:51,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:51,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:06:51,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:06:51,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543592194] [2025-01-09 16:06:51,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543592194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:51,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:51,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:06:51,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597184336] [2025-01-09 16:06:51,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:51,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:06:51,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:06:51,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:06:51,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:06:51,558 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:06:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:51,585 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2025-01-09 16:06:51,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:06:51,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-01-09 16:06:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:51,587 INFO L225 Difference]: With dead ends: 222 [2025-01-09 16:06:51,588 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 16:06:51,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:06:51,589 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:51,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:06:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 16:06:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-09 16:06:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:06:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-01-09 16:06:51,596 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 115 [2025-01-09 16:06:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:51,596 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-01-09 16:06:51,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:06:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-01-09 16:06:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 16:06:51,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:51,598 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:51,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:06:51,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:51,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash -682324813, now seen corresponding path program 1 times [2025-01-09 16:06:51,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:06:51,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254277477] [2025-01-09 16:06:51,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:06:51,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 16:06:51,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 16:06:51,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:51,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:06:52,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:06:52,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254277477] [2025-01-09 16:06:52,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254277477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:52,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:52,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:06:52,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775876570] [2025-01-09 16:06:52,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:52,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:06:52,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:06:52,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:06:52,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:06:52,668 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:06:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:53,079 INFO L93 Difference]: Finished difference Result 269 states and 383 transitions. [2025-01-09 16:06:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:06:53,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-01-09 16:06:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:53,081 INFO L225 Difference]: With dead ends: 269 [2025-01-09 16:06:53,081 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 16:06:53,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:06:53,082 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 216 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:53,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 656 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:06:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 16:06:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 124. [2025-01-09 16:06:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 110 states have (on average 1.3909090909090909) internal successors, (153), 110 states have internal predecessors, (153), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:06:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2025-01-09 16:06:53,107 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 115 [2025-01-09 16:06:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:53,109 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2025-01-09 16:06:53,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:06:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2025-01-09 16:06:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 16:06:53,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:53,114 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:53,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:06:53,114 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:53,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:53,118 INFO L85 PathProgramCache]: Analyzing trace with hash -890218128, now seen corresponding path program 1 times [2025-01-09 16:06:53,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:06:53,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530880169] [2025-01-09 16:06:53,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:53,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:06:53,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 16:06:53,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 16:06:53,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:53,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:06:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:06:55,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530880169] [2025-01-09 16:06:55,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530880169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:55,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:55,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:06:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774728862] [2025-01-09 16:06:55,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:55,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:06:55,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:06:55,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:06:55,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:06:55,302 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:06:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:55,655 INFO L93 Difference]: Finished difference Result 364 states and 523 transitions. [2025-01-09 16:06:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:06:55,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-01-09 16:06:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:55,658 INFO L225 Difference]: With dead ends: 364 [2025-01-09 16:06:55,658 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 16:06:55,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:06:55,659 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 211 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:55,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 370 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:06:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 16:06:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 229. [2025-01-09 16:06:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 202 states have (on average 1.391089108910891) internal successors, (281), 202 states have internal predecessors, (281), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 16:06:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 329 transitions. [2025-01-09 16:06:55,697 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 329 transitions. Word has length 116 [2025-01-09 16:06:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:55,697 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 329 transitions. [2025-01-09 16:06:55,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:06:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 329 transitions. [2025-01-09 16:06:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 16:06:55,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:55,700 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:55,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:06:55,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:55,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1489864665, now seen corresponding path program 1 times [2025-01-09 16:06:55,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:06:55,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046510658] [2025-01-09 16:06:55,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:55,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:06:55,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 16:06:55,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 16:06:55,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:55,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:06:56,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:06:56,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046510658] [2025-01-09 16:06:56,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046510658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:56,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:56,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:06:56,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032636944] [2025-01-09 16:06:56,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:56,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:06:56,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:06:56,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:06:56,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:06:56,931 INFO L87 Difference]: Start difference. First operand 229 states and 329 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:06:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:57,228 INFO L93 Difference]: Finished difference Result 529 states and 763 transitions. [2025-01-09 16:06:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:06:57,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-01-09 16:06:57,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:57,231 INFO L225 Difference]: With dead ends: 529 [2025-01-09 16:06:57,231 INFO L226 Difference]: Without dead ends: 303 [2025-01-09 16:06:57,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:06:57,232 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 115 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:57,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 429 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:06:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-09 16:06:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 291. [2025-01-09 16:06:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 251 states have (on average 1.3784860557768925) internal successors, (346), 251 states have internal predecessors, (346), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:06:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 418 transitions. [2025-01-09 16:06:57,269 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 418 transitions. Word has length 117 [2025-01-09 16:06:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:57,269 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 418 transitions. [2025-01-09 16:06:57,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:06:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 418 transitions. [2025-01-09 16:06:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 16:06:57,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:57,271 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:57,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:06:57,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:57,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash 588122532, now seen corresponding path program 1 times [2025-01-09 16:06:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:06:57,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801481004] [2025-01-09 16:06:57,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:06:57,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 16:06:57,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 16:06:57,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:57,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:06:57,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:06:57,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801481004] [2025-01-09 16:06:57,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801481004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:57,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:57,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:06:57,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686041894] [2025-01-09 16:06:57,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:57,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:06:57,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:06:57,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:06:57,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:06:57,725 INFO L87 Difference]: Start difference. First operand 291 states and 418 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:06:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:58,207 INFO L93 Difference]: Finished difference Result 608 states and 871 transitions. [2025-01-09 16:06:58,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:06:58,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-01-09 16:06:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:58,210 INFO L225 Difference]: With dead ends: 608 [2025-01-09 16:06:58,210 INFO L226 Difference]: Without dead ends: 382 [2025-01-09 16:06:58,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:06:58,212 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 225 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:58,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 578 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:06:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-01-09 16:06:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 316. [2025-01-09 16:06:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 276 states have (on average 1.3840579710144927) internal successors, (382), 276 states have internal predecessors, (382), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:06:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 454 transitions. [2025-01-09 16:06:58,254 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 454 transitions. Word has length 118 [2025-01-09 16:06:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:58,254 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 454 transitions. [2025-01-09 16:06:58,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:06:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 454 transitions. [2025-01-09 16:06:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 16:06:58,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:58,256 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:58,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:06:58,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:58,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1460103561, now seen corresponding path program 1 times [2025-01-09 16:06:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:06:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488390721] [2025-01-09 16:06:58,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:06:58,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 16:06:58,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 16:06:58,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:58,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:06:59,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:06:59,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488390721] [2025-01-09 16:06:59,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488390721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:59,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:59,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:06:59,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608542741] [2025-01-09 16:06:59,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:59,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:06:59,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:06:59,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:06:59,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:06:59,845 INFO L87 Difference]: Start difference. First operand 316 states and 454 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:01,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:01,149 INFO L93 Difference]: Finished difference Result 658 states and 944 transitions. [2025-01-09 16:07:01,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:07:01,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-01-09 16:07:01,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:01,152 INFO L225 Difference]: With dead ends: 658 [2025-01-09 16:07:01,152 INFO L226 Difference]: Without dead ends: 525 [2025-01-09 16:07:01,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:07:01,153 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 341 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:01,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1044 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 16:07:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-01-09 16:07:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 334. [2025-01-09 16:07:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 294 states have (on average 1.3911564625850341) internal successors, (409), 294 states have internal predecessors, (409), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 481 transitions. [2025-01-09 16:07:01,202 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 481 transitions. Word has length 118 [2025-01-09 16:07:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:01,203 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 481 transitions. [2025-01-09 16:07:01,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 481 transitions. [2025-01-09 16:07:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 16:07:01,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:01,205 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:01,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:07:01,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:01,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:01,206 INFO L85 PathProgramCache]: Analyzing trace with hash 463124473, now seen corresponding path program 1 times [2025-01-09 16:07:01,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:01,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569207322] [2025-01-09 16:07:01,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:01,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 16:07:01,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 16:07:01,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:01,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:02,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:02,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569207322] [2025-01-09 16:07:02,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569207322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:02,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:02,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:07:02,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765262551] [2025-01-09 16:07:02,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:02,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:07:02,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:02,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:07:02,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:07:02,323 INFO L87 Difference]: Start difference. First operand 334 states and 481 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:07:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:02,981 INFO L93 Difference]: Finished difference Result 499 states and 723 transitions. [2025-01-09 16:07:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:07:02,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 118 [2025-01-09 16:07:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:02,985 INFO L225 Difference]: With dead ends: 499 [2025-01-09 16:07:02,985 INFO L226 Difference]: Without dead ends: 351 [2025-01-09 16:07:02,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:07:02,987 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 147 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:02,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 480 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:07:02,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-09 16:07:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 322. [2025-01-09 16:07:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 282 states have (on average 1.375886524822695) internal successors, (388), 282 states have internal predecessors, (388), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 460 transitions. [2025-01-09 16:07:03,031 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 460 transitions. Word has length 118 [2025-01-09 16:07:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:03,031 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 460 transitions. [2025-01-09 16:07:03,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:07:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 460 transitions. [2025-01-09 16:07:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 16:07:03,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:03,034 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:03,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:07:03,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:03,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:03,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1882983742, now seen corresponding path program 1 times [2025-01-09 16:07:03,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:03,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521296624] [2025-01-09 16:07:03,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:03,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:03,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 16:07:03,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 16:07:03,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:03,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:04,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:04,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521296624] [2025-01-09 16:07:04,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521296624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:04,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:04,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:07:04,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441269767] [2025-01-09 16:07:04,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:04,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:07:04,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:04,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:07:04,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:07:04,774 INFO L87 Difference]: Start difference. First operand 322 states and 460 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:07:05,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:05,673 INFO L93 Difference]: Finished difference Result 651 states and 930 transitions. [2025-01-09 16:07:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:07:05,673 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 118 [2025-01-09 16:07:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:05,676 INFO L225 Difference]: With dead ends: 651 [2025-01-09 16:07:05,676 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 16:07:05,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:07:05,679 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 190 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:05,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 700 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 16:07:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 16:07:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 336. [2025-01-09 16:07:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 296 states have (on average 1.3817567567567568) internal successors, (409), 296 states have internal predecessors, (409), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 481 transitions. [2025-01-09 16:07:05,716 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 481 transitions. Word has length 118 [2025-01-09 16:07:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:05,717 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 481 transitions. [2025-01-09 16:07:05,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:07:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 481 transitions. [2025-01-09 16:07:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:07:05,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:05,720 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:05,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:07:05,720 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:05,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash -182669776, now seen corresponding path program 1 times [2025-01-09 16:07:05,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:05,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392226583] [2025-01-09 16:07:05,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:05,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:07:05,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:07:05,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:05,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:06,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392226583] [2025-01-09 16:07:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392226583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:06,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:07:06,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125206413] [2025-01-09 16:07:06,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:06,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:07:06,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:06,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:07:06,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:07:06,901 INFO L87 Difference]: Start difference. First operand 336 states and 481 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:07:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:07,616 INFO L93 Difference]: Finished difference Result 631 states and 903 transitions. [2025-01-09 16:07:07,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:07:07,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-01-09 16:07:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:07,619 INFO L225 Difference]: With dead ends: 631 [2025-01-09 16:07:07,619 INFO L226 Difference]: Without dead ends: 358 [2025-01-09 16:07:07,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:07:07,622 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 137 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:07,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 732 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:07:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-01-09 16:07:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 343. [2025-01-09 16:07:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 303 states have (on average 1.3762376237623761) internal successors, (417), 303 states have internal predecessors, (417), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 489 transitions. [2025-01-09 16:07:07,667 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 489 transitions. Word has length 119 [2025-01-09 16:07:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:07,668 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 489 transitions. [2025-01-09 16:07:07,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:07:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 489 transitions. [2025-01-09 16:07:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:07:07,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:07,673 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:07,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:07:07,674 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:07,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:07,674 INFO L85 PathProgramCache]: Analyzing trace with hash -692142866, now seen corresponding path program 1 times [2025-01-09 16:07:07,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:07,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852024616] [2025-01-09 16:07:07,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:07,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:07,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:07:07,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:07:07,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:07,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:07,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:07,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852024616] [2025-01-09 16:07:07,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852024616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:07,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:07,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:07:07,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973516806] [2025-01-09 16:07:07,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:07,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:07:07,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:07,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:07:07,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:07:07,873 INFO L87 Difference]: Start difference. First operand 343 states and 489 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:08,077 INFO L93 Difference]: Finished difference Result 623 states and 891 transitions. [2025-01-09 16:07:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:07:08,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-01-09 16:07:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:08,080 INFO L225 Difference]: With dead ends: 623 [2025-01-09 16:07:08,080 INFO L226 Difference]: Without dead ends: 348 [2025-01-09 16:07:08,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:07:08,083 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 12 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:08,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 518 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:07:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-09 16:07:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 342. [2025-01-09 16:07:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 302 states have (on average 1.3642384105960266) internal successors, (412), 302 states have internal predecessors, (412), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 484 transitions. [2025-01-09 16:07:08,117 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 484 transitions. Word has length 119 [2025-01-09 16:07:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:08,119 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 484 transitions. [2025-01-09 16:07:08,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 484 transitions. [2025-01-09 16:07:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:07:08,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:08,121 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:08,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:07:08,121 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:08,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1797386096, now seen corresponding path program 1 times [2025-01-09 16:07:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940116573] [2025-01-09 16:07:08,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:08,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:07:08,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:07:08,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:08,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:08,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:08,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940116573] [2025-01-09 16:07:08,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940116573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:08,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:08,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:07:08,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390989999] [2025-01-09 16:07:08,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:08,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:07:08,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:08,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:07:08,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:07:08,585 INFO L87 Difference]: Start difference. First operand 342 states and 484 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:09,005 INFO L93 Difference]: Finished difference Result 651 states and 923 transitions. [2025-01-09 16:07:09,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:07:09,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-01-09 16:07:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:09,008 INFO L225 Difference]: With dead ends: 651 [2025-01-09 16:07:09,008 INFO L226 Difference]: Without dead ends: 380 [2025-01-09 16:07:09,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:07:09,009 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 218 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:09,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 476 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:07:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-09 16:07:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 342. [2025-01-09 16:07:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 302 states have (on average 1.3476821192052981) internal successors, (407), 302 states have internal predecessors, (407), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 479 transitions. [2025-01-09 16:07:09,044 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 479 transitions. Word has length 119 [2025-01-09 16:07:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:09,044 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 479 transitions. [2025-01-09 16:07:09,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:09,044 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 479 transitions. [2025-01-09 16:07:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:07:09,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:09,046 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:09,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:07:09,047 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:09,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:09,047 INFO L85 PathProgramCache]: Analyzing trace with hash 786268846, now seen corresponding path program 1 times [2025-01-09 16:07:09,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:09,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989612537] [2025-01-09 16:07:09,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:09,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:09,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:07:09,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:07:09,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:09,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989612537] [2025-01-09 16:07:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989612537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:11,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:11,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 16:07:11,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586831957] [2025-01-09 16:07:11,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:11,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:07:11,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:11,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:07:11,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:07:11,972 INFO L87 Difference]: Start difference. First operand 342 states and 479 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:07:14,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:14,200 INFO L93 Difference]: Finished difference Result 664 states and 928 transitions. [2025-01-09 16:07:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:07:14,200 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-01-09 16:07:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:14,202 INFO L225 Difference]: With dead ends: 664 [2025-01-09 16:07:14,202 INFO L226 Difference]: Without dead ends: 393 [2025-01-09 16:07:14,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:07:14,205 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 533 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:14,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1319 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 16:07:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-01-09 16:07:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 352. [2025-01-09 16:07:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 312 states have (on average 1.3461538461538463) internal successors, (420), 312 states have internal predecessors, (420), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 492 transitions. [2025-01-09 16:07:14,238 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 492 transitions. Word has length 119 [2025-01-09 16:07:14,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:14,240 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 492 transitions. [2025-01-09 16:07:14,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:07:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 492 transitions. [2025-01-09 16:07:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 16:07:14,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:14,242 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:14,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:07:14,242 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:14,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2094139669, now seen corresponding path program 1 times [2025-01-09 16:07:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:14,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755554804] [2025-01-09 16:07:14,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:14,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:14,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 16:07:14,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 16:07:14,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:14,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:14,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:14,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755554804] [2025-01-09 16:07:14,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755554804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:14,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:14,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:07:14,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266064878] [2025-01-09 16:07:14,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:14,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:07:14,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:14,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:07:14,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:07:14,705 INFO L87 Difference]: Start difference. First operand 352 states and 492 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:14,993 INFO L93 Difference]: Finished difference Result 564 states and 789 transitions. [2025-01-09 16:07:14,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:07:14,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-01-09 16:07:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:14,997 INFO L225 Difference]: With dead ends: 564 [2025-01-09 16:07:14,997 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 16:07:14,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:07:14,999 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 215 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:15,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 401 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:07:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 16:07:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 351. [2025-01-09 16:07:15,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 311 states have (on average 1.3408360128617363) internal successors, (417), 311 states have internal predecessors, (417), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 489 transitions. [2025-01-09 16:07:15,036 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 489 transitions. Word has length 119 [2025-01-09 16:07:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:15,036 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 489 transitions. [2025-01-09 16:07:15,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 489 transitions. [2025-01-09 16:07:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 16:07:15,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:15,039 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:15,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:07:15,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:15,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:15,039 INFO L85 PathProgramCache]: Analyzing trace with hash -582239163, now seen corresponding path program 1 times [2025-01-09 16:07:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889861896] [2025-01-09 16:07:15,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:15,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:15,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 16:07:15,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 16:07:15,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:15,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:16,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:16,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889861896] [2025-01-09 16:07:16,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889861896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:16,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:16,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:07:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834922027] [2025-01-09 16:07:16,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:16,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:07:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:16,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:07:16,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:07:16,816 INFO L87 Difference]: Start difference. First operand 351 states and 489 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:07:17,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:17,621 INFO L93 Difference]: Finished difference Result 711 states and 986 transitions. [2025-01-09 16:07:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:07:17,621 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-01-09 16:07:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:17,624 INFO L225 Difference]: With dead ends: 711 [2025-01-09 16:07:17,624 INFO L226 Difference]: Without dead ends: 420 [2025-01-09 16:07:17,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:07:17,625 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 521 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:17,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 648 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:07:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-01-09 16:07:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 377. [2025-01-09 16:07:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 337 states have (on average 1.3353115727002967) internal successors, (450), 337 states have internal predecessors, (450), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 522 transitions. [2025-01-09 16:07:17,660 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 522 transitions. Word has length 120 [2025-01-09 16:07:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:17,661 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 522 transitions. [2025-01-09 16:07:17,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:07:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 522 transitions. [2025-01-09 16:07:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 16:07:17,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:17,662 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:17,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:07:17,663 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:17,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:17,663 INFO L85 PathProgramCache]: Analyzing trace with hash 803964231, now seen corresponding path program 1 times [2025-01-09 16:07:17,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:17,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715952748] [2025-01-09 16:07:17,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:17,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:17,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 16:07:17,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 16:07:17,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:17,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:19,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:19,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715952748] [2025-01-09 16:07:19,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715952748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:19,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:19,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:07:19,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925061685] [2025-01-09 16:07:19,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:19,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:07:19,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:19,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:07:19,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:07:19,613 INFO L87 Difference]: Start difference. First operand 377 states and 522 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:07:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:20,533 INFO L93 Difference]: Finished difference Result 720 states and 994 transitions. [2025-01-09 16:07:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:07:20,534 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-01-09 16:07:20,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:20,536 INFO L225 Difference]: With dead ends: 720 [2025-01-09 16:07:20,536 INFO L226 Difference]: Without dead ends: 413 [2025-01-09 16:07:20,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:07:20,537 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 502 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:20,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 744 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:07:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-09 16:07:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 367. [2025-01-09 16:07:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 327 states have (on average 1.3333333333333333) internal successors, (436), 327 states have internal predecessors, (436), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 508 transitions. [2025-01-09 16:07:20,571 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 508 transitions. Word has length 120 [2025-01-09 16:07:20,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:20,571 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 508 transitions. [2025-01-09 16:07:20,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:07:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 508 transitions. [2025-01-09 16:07:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 16:07:20,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:20,573 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:20,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:07:20,574 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:20,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2012889427, now seen corresponding path program 1 times [2025-01-09 16:07:20,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:20,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182381646] [2025-01-09 16:07:20,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:20,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:07:20,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:07:20,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:20,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:21,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182381646] [2025-01-09 16:07:21,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182381646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:21,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:21,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:07:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722217188] [2025-01-09 16:07:21,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:21,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:07:21,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:21,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:07:21,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:07:21,105 INFO L87 Difference]: Start difference. First operand 367 states and 508 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:21,493 INFO L93 Difference]: Finished difference Result 764 states and 1055 transitions. [2025-01-09 16:07:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:07:21,493 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2025-01-09 16:07:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:21,495 INFO L225 Difference]: With dead ends: 764 [2025-01-09 16:07:21,495 INFO L226 Difference]: Without dead ends: 467 [2025-01-09 16:07:21,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:07:21,497 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 161 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:21,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1130 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:07:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-01-09 16:07:21,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 391. [2025-01-09 16:07:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 351 states have (on average 1.3361823361823362) internal successors, (469), 351 states have internal predecessors, (469), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 541 transitions. [2025-01-09 16:07:21,530 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 541 transitions. Word has length 121 [2025-01-09 16:07:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:21,530 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 541 transitions. [2025-01-09 16:07:21,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 541 transitions. [2025-01-09 16:07:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 16:07:21,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:21,532 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:21,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:07:21,532 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:21,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:21,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2063223151, now seen corresponding path program 1 times [2025-01-09 16:07:21,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:21,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169847310] [2025-01-09 16:07:21,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:21,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:21,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:07:21,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:07:21,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:21,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:21,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:21,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169847310] [2025-01-09 16:07:21,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169847310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:21,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:21,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:07:21,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933696469] [2025-01-09 16:07:21,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:21,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:07:21,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:21,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:07:21,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:07:21,837 INFO L87 Difference]: Start difference. First operand 391 states and 541 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:22,152 INFO L93 Difference]: Finished difference Result 777 states and 1073 transitions. [2025-01-09 16:07:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:07:22,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2025-01-09 16:07:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:22,154 INFO L225 Difference]: With dead ends: 777 [2025-01-09 16:07:22,155 INFO L226 Difference]: Without dead ends: 456 [2025-01-09 16:07:22,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:07:22,156 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 160 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:22,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 619 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:07:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-01-09 16:07:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 391. [2025-01-09 16:07:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 351 states have (on average 1.3333333333333333) internal successors, (468), 351 states have internal predecessors, (468), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 540 transitions. [2025-01-09 16:07:22,194 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 540 transitions. Word has length 121 [2025-01-09 16:07:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:22,194 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 540 transitions. [2025-01-09 16:07:22,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 540 transitions. [2025-01-09 16:07:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 16:07:22,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:22,196 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:22,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 16:07:22,196 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash -518276194, now seen corresponding path program 1 times [2025-01-09 16:07:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070150777] [2025-01-09 16:07:22,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:22,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 16:07:22,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 16:07:22,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:22,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:22,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:22,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070150777] [2025-01-09 16:07:22,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070150777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:22,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:22,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:07:22,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587985148] [2025-01-09 16:07:22,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:22,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:07:22,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:22,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:07:22,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:07:22,877 INFO L87 Difference]: Start difference. First operand 391 states and 540 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:23,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:23,256 INFO L93 Difference]: Finished difference Result 635 states and 878 transitions. [2025-01-09 16:07:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:07:23,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2025-01-09 16:07:23,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:23,259 INFO L225 Difference]: With dead ends: 635 [2025-01-09 16:07:23,259 INFO L226 Difference]: Without dead ends: 467 [2025-01-09 16:07:23,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:07:23,260 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 214 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:23,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 649 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:07:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-01-09 16:07:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 401. [2025-01-09 16:07:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 361 states have (on average 1.332409972299169) internal successors, (481), 361 states have internal predecessors, (481), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 553 transitions. [2025-01-09 16:07:23,298 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 553 transitions. Word has length 121 [2025-01-09 16:07:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:23,298 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 553 transitions. [2025-01-09 16:07:23,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 553 transitions. [2025-01-09 16:07:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:07:23,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:23,301 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:23,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 16:07:23,301 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:23,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1584642617, now seen corresponding path program 1 times [2025-01-09 16:07:23,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:23,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651942612] [2025-01-09 16:07:23,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:23,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:23,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:07:23,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:07:23,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:23,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:23,517 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:23,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:23,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651942612] [2025-01-09 16:07:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651942612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:23,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:23,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:07:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078965278] [2025-01-09 16:07:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:23,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:07:23,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:23,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:07:23,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:07:23,521 INFO L87 Difference]: Start difference. First operand 401 states and 553 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:23,712 INFO L93 Difference]: Finished difference Result 770 states and 1062 transitions. [2025-01-09 16:07:23,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:07:23,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-01-09 16:07:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:23,718 INFO L225 Difference]: With dead ends: 770 [2025-01-09 16:07:23,718 INFO L226 Difference]: Without dead ends: 439 [2025-01-09 16:07:23,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:07:23,723 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 81 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:23,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 383 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:07:23,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-01-09 16:07:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 414. [2025-01-09 16:07:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 374 states have (on average 1.3288770053475936) internal successors, (497), 374 states have internal predecessors, (497), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 569 transitions. [2025-01-09 16:07:23,757 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 569 transitions. Word has length 122 [2025-01-09 16:07:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:23,757 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 569 transitions. [2025-01-09 16:07:23,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 569 transitions. [2025-01-09 16:07:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:07:23,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:23,760 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:23,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:07:23,760 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:23,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1284007918, now seen corresponding path program 1 times [2025-01-09 16:07:23,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:23,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081326529] [2025-01-09 16:07:23,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:23,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:23,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:07:23,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:07:23,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:23,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:24,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:24,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081326529] [2025-01-09 16:07:24,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081326529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:24,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:24,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 16:07:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469064150] [2025-01-09 16:07:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:24,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:07:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:24,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:07:24,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:07:24,882 INFO L87 Difference]: Start difference. First operand 414 states and 569 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:25,740 INFO L93 Difference]: Finished difference Result 941 states and 1284 transitions. [2025-01-09 16:07:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:07:25,740 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-01-09 16:07:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:25,743 INFO L225 Difference]: With dead ends: 941 [2025-01-09 16:07:25,743 INFO L226 Difference]: Without dead ends: 597 [2025-01-09 16:07:25,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:07:25,745 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 202 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:25,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1247 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 16:07:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-01-09 16:07:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 434. [2025-01-09 16:07:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 394 states have (on average 1.3223350253807107) internal successors, (521), 394 states have internal predecessors, (521), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 593 transitions. [2025-01-09 16:07:25,782 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 593 transitions. Word has length 122 [2025-01-09 16:07:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:25,782 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 593 transitions. [2025-01-09 16:07:25,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 593 transitions. [2025-01-09 16:07:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:07:25,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:25,784 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:25,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 16:07:25,784 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:25,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:25,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1985072496, now seen corresponding path program 1 times [2025-01-09 16:07:25,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:25,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974852187] [2025-01-09 16:07:25,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:25,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:25,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:07:25,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:07:25,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:25,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:27,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:27,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974852187] [2025-01-09 16:07:27,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974852187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:27,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:27,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:07:27,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889432805] [2025-01-09 16:07:27,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:27,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:07:27,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:27,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:07:27,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:07:27,977 INFO L87 Difference]: Start difference. First operand 434 states and 593 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 16:07:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:29,142 INFO L93 Difference]: Finished difference Result 937 states and 1278 transitions. [2025-01-09 16:07:29,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:07:29,142 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 122 [2025-01-09 16:07:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:29,145 INFO L225 Difference]: With dead ends: 937 [2025-01-09 16:07:29,145 INFO L226 Difference]: Without dead ends: 593 [2025-01-09 16:07:29,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:07:29,147 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 284 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:29,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 865 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:07:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-01-09 16:07:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 434. [2025-01-09 16:07:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 394 states have (on average 1.3197969543147208) internal successors, (520), 394 states have internal predecessors, (520), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 592 transitions. [2025-01-09 16:07:29,191 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 592 transitions. Word has length 122 [2025-01-09 16:07:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:29,192 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 592 transitions. [2025-01-09 16:07:29,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 16:07:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 592 transitions. [2025-01-09 16:07:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:07:29,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:29,193 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:29,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 16:07:29,194 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:29,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:29,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1985607792, now seen corresponding path program 1 times [2025-01-09 16:07:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:29,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960285443] [2025-01-09 16:07:29,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:29,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:29,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:07:29,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:07:29,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:29,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:29,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:29,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960285443] [2025-01-09 16:07:29,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960285443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:29,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:29,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:07:29,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498864733] [2025-01-09 16:07:29,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:29,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:07:29,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:29,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:07:29,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:07:29,731 INFO L87 Difference]: Start difference. First operand 434 states and 592 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:30,236 INFO L93 Difference]: Finished difference Result 901 states and 1234 transitions. [2025-01-09 16:07:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:07:30,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-01-09 16:07:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:30,243 INFO L225 Difference]: With dead ends: 901 [2025-01-09 16:07:30,243 INFO L226 Difference]: Without dead ends: 557 [2025-01-09 16:07:30,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:07:30,249 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 233 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:30,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 449 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:07:30,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-09 16:07:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 513. [2025-01-09 16:07:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 473 states have (on average 1.3255813953488371) internal successors, (627), 473 states have internal predecessors, (627), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 699 transitions. [2025-01-09 16:07:30,292 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 699 transitions. Word has length 122 [2025-01-09 16:07:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:30,292 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 699 transitions. [2025-01-09 16:07:30,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 699 transitions. [2025-01-09 16:07:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:07:30,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:30,294 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:30,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 16:07:30,294 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:30,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:30,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1608294926, now seen corresponding path program 1 times [2025-01-09 16:07:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:30,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261429885] [2025-01-09 16:07:30,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:30,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:30,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:07:30,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:07:30,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:30,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:32,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:32,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261429885] [2025-01-09 16:07:32,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261429885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:32,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:32,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 16:07:32,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141877690] [2025-01-09 16:07:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:32,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 16:07:32,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:32,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 16:07:32,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:07:32,216 INFO L87 Difference]: Start difference. First operand 513 states and 699 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:07:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:33,602 INFO L93 Difference]: Finished difference Result 1095 states and 1490 transitions. [2025-01-09 16:07:33,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:07:33,603 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-01-09 16:07:33,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:33,605 INFO L225 Difference]: With dead ends: 1095 [2025-01-09 16:07:33,605 INFO L226 Difference]: Without dead ends: 672 [2025-01-09 16:07:33,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-01-09 16:07:33,608 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 360 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:33,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1565 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 16:07:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-01-09 16:07:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 553. [2025-01-09 16:07:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 513 states have (on average 1.3235867446393763) internal successors, (679), 513 states have internal predecessors, (679), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:33,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 751 transitions. [2025-01-09 16:07:33,654 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 751 transitions. Word has length 122 [2025-01-09 16:07:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:33,655 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 751 transitions. [2025-01-09 16:07:33,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:07:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 751 transitions. [2025-01-09 16:07:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:07:33,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:33,657 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:33,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 16:07:33,658 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:33,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:33,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1241021669, now seen corresponding path program 1 times [2025-01-09 16:07:33,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:33,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035571420] [2025-01-09 16:07:33,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:33,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:33,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:07:33,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:07:33,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:33,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:35,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:35,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035571420] [2025-01-09 16:07:35,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035571420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:35,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:35,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 16:07:35,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623939396] [2025-01-09 16:07:35,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:35,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:07:35,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:35,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:07:35,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:07:35,614 INFO L87 Difference]: Start difference. First operand 553 states and 751 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:07:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:36,739 INFO L93 Difference]: Finished difference Result 916 states and 1241 transitions. [2025-01-09 16:07:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:07:36,739 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2025-01-09 16:07:36,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:36,743 INFO L225 Difference]: With dead ends: 916 [2025-01-09 16:07:36,743 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 16:07:36,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:07:36,745 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 468 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:36,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 896 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 16:07:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 16:07:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 576. [2025-01-09 16:07:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 534 states have (on average 1.3183520599250935) internal successors, (704), 534 states have internal predecessors, (704), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 776 transitions. [2025-01-09 16:07:36,791 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 776 transitions. Word has length 122 [2025-01-09 16:07:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:36,791 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 776 transitions. [2025-01-09 16:07:36,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:07:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 776 transitions. [2025-01-09 16:07:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 16:07:36,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:36,792 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:36,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 16:07:36,793 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:36,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:36,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1130717593, now seen corresponding path program 1 times [2025-01-09 16:07:36,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:36,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139514682] [2025-01-09 16:07:36,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:36,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:36,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 16:07:36,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 16:07:36,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:36,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:40,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:40,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139514682] [2025-01-09 16:07:40,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139514682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:40,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:40,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-01-09 16:07:40,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068091637] [2025-01-09 16:07:40,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:40,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 16:07:40,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:40,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 16:07:40,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:07:40,263 INFO L87 Difference]: Start difference. First operand 576 states and 776 transitions. Second operand has 21 states, 18 states have (on average 3.611111111111111) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-09 16:07:43,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:43,169 INFO L93 Difference]: Finished difference Result 1041 states and 1402 transitions. [2025-01-09 16:07:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:07:43,169 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.611111111111111) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) Word has length 122 [2025-01-09 16:07:43,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:43,171 INFO L225 Difference]: With dead ends: 1041 [2025-01-09 16:07:43,171 INFO L226 Difference]: Without dead ends: 768 [2025-01-09 16:07:43,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 16:07:43,172 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 473 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:43,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1498 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 16:07:43,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-01-09 16:07:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 581. [2025-01-09 16:07:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 539 states have (on average 1.3172541743970316) internal successors, (710), 539 states have internal predecessors, (710), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 782 transitions. [2025-01-09 16:07:43,212 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 782 transitions. Word has length 122 [2025-01-09 16:07:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:43,212 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 782 transitions. [2025-01-09 16:07:43,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.611111111111111) internal successors, (65), 21 states have internal predecessors, (65), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-09 16:07:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 782 transitions. [2025-01-09 16:07:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:07:43,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:43,214 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:43,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 16:07:43,214 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:43,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash 897774528, now seen corresponding path program 1 times [2025-01-09 16:07:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571867210] [2025-01-09 16:07:43,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:43,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:07:43,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:07:43,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:43,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 16:07:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571867210] [2025-01-09 16:07:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571867210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:07:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323866880] [2025-01-09 16:07:43,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:43,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:07:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:07:43,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:07:43,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:07:43,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:07:43,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:07:43,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:43,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:43,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:07:43,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:07:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:43,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:07:43,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323866880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:43,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:07:43,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 16:07:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445189204] [2025-01-09 16:07:43,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:43,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:07:43,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:43,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:07:43,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:07:43,667 INFO L87 Difference]: Start difference. First operand 581 states and 782 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:43,730 INFO L93 Difference]: Finished difference Result 1033 states and 1396 transitions. [2025-01-09 16:07:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:07:43,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2025-01-09 16:07:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:43,733 INFO L225 Difference]: With dead ends: 1033 [2025-01-09 16:07:43,733 INFO L226 Difference]: Without dead ends: 587 [2025-01-09 16:07:43,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:07:43,738 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:43,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 600 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:07:43,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-01-09 16:07:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2025-01-09 16:07:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 545 states have (on average 1.3137614678899083) internal successors, (716), 545 states have internal predecessors, (716), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 788 transitions. [2025-01-09 16:07:43,789 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 788 transitions. Word has length 124 [2025-01-09 16:07:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:43,789 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 788 transitions. [2025-01-09 16:07:43,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 788 transitions. [2025-01-09 16:07:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:07:43,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:43,790 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:43,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:07:43,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 16:07:43,991 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:43,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:43,992 INFO L85 PathProgramCache]: Analyzing trace with hash -145153137, now seen corresponding path program 1 times [2025-01-09 16:07:43,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:43,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37200037] [2025-01-09 16:07:43,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:44,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:07:44,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:07:44,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:44,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:45,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:45,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37200037] [2025-01-09 16:07:45,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37200037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:45,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:45,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 16:07:45,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268243230] [2025-01-09 16:07:45,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:45,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 16:07:45,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:45,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 16:07:45,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:07:45,764 INFO L87 Difference]: Start difference. First operand 587 states and 788 transitions. Second operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:07:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:46,854 INFO L93 Difference]: Finished difference Result 893 states and 1204 transitions. [2025-01-09 16:07:46,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:07:46,854 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 124 [2025-01-09 16:07:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:46,857 INFO L225 Difference]: With dead ends: 893 [2025-01-09 16:07:46,857 INFO L226 Difference]: Without dead ends: 617 [2025-01-09 16:07:46,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2025-01-09 16:07:46,859 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 354 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:46,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1346 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:07:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-01-09 16:07:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 590. [2025-01-09 16:07:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 548 states have (on average 1.312043795620438) internal successors, (719), 548 states have internal predecessors, (719), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 791 transitions. [2025-01-09 16:07:46,907 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 791 transitions. Word has length 124 [2025-01-09 16:07:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:46,907 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 791 transitions. [2025-01-09 16:07:46,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 19 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:07:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 791 transitions. [2025-01-09 16:07:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:07:46,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:46,908 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:46,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 16:07:46,908 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:46,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash -445787836, now seen corresponding path program 1 times [2025-01-09 16:07:46,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:46,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701767924] [2025-01-09 16:07:46,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:46,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:07:46,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:07:46,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:46,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:47,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701767924] [2025-01-09 16:07:47,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701767924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:47,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:47,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:07:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247515452] [2025-01-09 16:07:47,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:47,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:07:47,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:47,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:07:47,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:07:47,139 INFO L87 Difference]: Start difference. First operand 590 states and 791 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:47,291 INFO L93 Difference]: Finished difference Result 894 states and 1203 transitions. [2025-01-09 16:07:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:07:47,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2025-01-09 16:07:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:47,294 INFO L225 Difference]: With dead ends: 894 [2025-01-09 16:07:47,294 INFO L226 Difference]: Without dead ends: 615 [2025-01-09 16:07:47,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:07:47,296 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 40 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:47,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 549 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:07:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-01-09 16:07:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 590. [2025-01-09 16:07:47,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 548 states have (on average 1.3102189781021898) internal successors, (718), 548 states have internal predecessors, (718), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:47,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 790 transitions. [2025-01-09 16:07:47,344 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 790 transitions. Word has length 124 [2025-01-09 16:07:47,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:47,345 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 790 transitions. [2025-01-09 16:07:47,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 790 transitions. [2025-01-09 16:07:47,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 16:07:47,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:47,346 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:47,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 16:07:47,346 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:47,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:47,347 INFO L85 PathProgramCache]: Analyzing trace with hash 97908549, now seen corresponding path program 1 times [2025-01-09 16:07:47,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:47,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827157367] [2025-01-09 16:07:47,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:47,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:47,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 16:07:47,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 16:07:47,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:47,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:47,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:47,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827157367] [2025-01-09 16:07:47,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827157367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:47,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:47,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:07:47,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717396668] [2025-01-09 16:07:47,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:47,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:07:47,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:47,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:07:47,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:07:47,541 INFO L87 Difference]: Start difference. First operand 590 states and 790 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:47,719 INFO L93 Difference]: Finished difference Result 1064 states and 1428 transitions. [2025-01-09 16:07:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:07:47,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2025-01-09 16:07:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:47,722 INFO L225 Difference]: With dead ends: 1064 [2025-01-09 16:07:47,722 INFO L226 Difference]: Without dead ends: 609 [2025-01-09 16:07:47,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:07:47,725 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 61 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:47,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 385 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:07:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-01-09 16:07:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 590. [2025-01-09 16:07:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 548 states have (on average 1.3083941605839415) internal successors, (717), 548 states have internal predecessors, (717), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 789 transitions. [2025-01-09 16:07:47,774 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 789 transitions. Word has length 126 [2025-01-09 16:07:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:47,775 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 789 transitions. [2025-01-09 16:07:47,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 789 transitions. [2025-01-09 16:07:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 16:07:47,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:47,776 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:47,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 16:07:47,776 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:47,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:47,777 INFO L85 PathProgramCache]: Analyzing trace with hash -382720434, now seen corresponding path program 1 times [2025-01-09 16:07:47,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:47,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258005150] [2025-01-09 16:07:47,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:47,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:47,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 16:07:47,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 16:07:47,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:47,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:07:47,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:47,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258005150] [2025-01-09 16:07:47,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258005150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:47,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:47,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:07:47,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221582871] [2025-01-09 16:07:47,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:47,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:07:47,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:47,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:07:47,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:07:47,842 INFO L87 Difference]: Start difference. First operand 590 states and 789 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:47,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:47,899 INFO L93 Difference]: Finished difference Result 1041 states and 1396 transitions. [2025-01-09 16:07:47,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:07:47,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2025-01-09 16:07:47,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:47,903 INFO L225 Difference]: With dead ends: 1041 [2025-01-09 16:07:47,903 INFO L226 Difference]: Without dead ends: 586 [2025-01-09 16:07:47,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:07:47,904 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:47,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:07:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-01-09 16:07:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-01-09 16:07:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 544 states have (on average 1.3033088235294117) internal successors, (709), 544 states have internal predecessors, (709), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 16:07:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 781 transitions. [2025-01-09 16:07:47,950 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 781 transitions. Word has length 128 [2025-01-09 16:07:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:47,951 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 781 transitions. [2025-01-09 16:07:47,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:07:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 781 transitions. [2025-01-09 16:07:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 16:07:47,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:47,952 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:47,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 16:07:47,952 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:47,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1456594839, now seen corresponding path program 1 times [2025-01-09 16:07:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:47,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208505691] [2025-01-09 16:07:47,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:47,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 16:07:48,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 16:07:48,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:48,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:07:48,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:07:48,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 16:07:48,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 16:07:48,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:48,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:07:48,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:07:48,242 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:07:48,242 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:07:48,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 16:07:48,247 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:48,365 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:07:48,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:07:48 BoogieIcfgContainer [2025-01-09 16:07:48,368 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:07:48,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:07:48,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:07:48,368 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:07:48,369 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:06:49" (3/4) ... [2025-01-09 16:07:48,372 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:07:48,372 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:07:48,373 INFO L158 Benchmark]: Toolchain (without parser) took 59976.77ms. Allocated memory was 201.3MB in the beginning and 721.4MB in the end (delta: 520.1MB). Free memory was 155.3MB in the beginning and 491.6MB in the end (delta: -336.2MB). Peak memory consumption was 182.1MB. Max. memory is 16.1GB. [2025-01-09 16:07:48,373 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:07:48,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.04ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 140.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:07:48,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.67ms. Allocated memory is still 201.3MB. Free memory was 140.0MB in the beginning and 136.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:07:48,373 INFO L158 Benchmark]: Boogie Preprocessor took 52.08ms. Allocated memory is still 201.3MB. Free memory was 136.8MB in the beginning and 134.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:07:48,374 INFO L158 Benchmark]: RCFGBuilder took 714.26ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 101.2MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:07:48,374 INFO L158 Benchmark]: TraceAbstraction took 58833.39ms. Allocated memory was 201.3MB in the beginning and 721.4MB in the end (delta: 520.1MB). Free memory was 100.6MB in the beginning and 495.9MB in the end (delta: -395.3MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2025-01-09 16:07:48,374 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 721.4MB. Free memory was 495.9MB in the beginning and 491.6MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:07:48,375 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.25ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.04ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 140.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.67ms. Allocated memory is still 201.3MB. Free memory was 140.0MB in the beginning and 136.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.08ms. Allocated memory is still 201.3MB. Free memory was 136.8MB in the beginning and 134.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 714.26ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 101.2MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 58833.39ms. Allocated memory was 201.3MB in the beginning and 721.4MB in the end (delta: 520.1MB). Free memory was 100.6MB in the beginning and 495.9MB in the end (delta: -395.3MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 721.4MB. Free memory was 495.9MB in the beginning and 491.6MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 89, overapproximation of someBinaryArithmeticDOUBLEoperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 110. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L51] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L53] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L54] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L55] unsigned long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L56] unsigned long int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L57] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L58] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L59] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L60] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L61] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L62] double* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L63] signed long int last_1_WrapperStruct00_var_1_10 = -10; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=0, last_1_WrapperStruct00_var_1_10=-10] [L124] isInitial = 1 [L125] FCALL initially() [L127] CALL updateLastVariables() [L117] EXPR WrapperStruct00.var_1_10 [L117] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L95] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L98] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L101] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L102] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L103] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_ulong() [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L107] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_12 [L108] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_12 [L108] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] EXPR (WrapperStruct00.var_1_13 >= 0.0F && 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}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && 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}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && 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}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L111] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] EXPR (WrapperStruct00.var_1_14 >= 0.0F && 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}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && 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}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && 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}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L113] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_15 [L114] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_15 [L114] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L128] RET updateVariables() [L129] CALL step() [L67] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L67] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L70] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L70] EXPR ((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L70] (*(WrapperStruct00_var_1_8_Pointer)) = ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))) [L72] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L72] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L75] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L75] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_2_Pointer)); [L76] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L76] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_10_Pointer)); [L77] stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L77] stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10, stepLocal_0=-10] [L77] COND TRUE stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L78] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10, stepLocal_0=-10] [L78] COND FALSE !(stepLocal_0 < (*(WrapperStruct00_var_1_8_Pointer))) [L83] (*(WrapperStruct00_var_1_1_Pointer)) = 2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L88] COND TRUE (*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L89] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L89] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L89] (*(WrapperStruct00_var_1_11_Pointer)) = ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L120] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) [L120] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2)) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L120] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer)))))))) [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))) [L120] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1) [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) [L120] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L120] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L120] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120-L121] return (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.7s, OverallIterations: 34, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6677 SdHoareTripleChecker+Valid, 14.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6674 mSDsluCounter, 22799 SdHoareTripleChecker+Invalid, 13.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18245 mSDsCounter, 780 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15859 IncrementalHoareTripleChecker+Invalid, 16639 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 780 mSolverCounterUnsat, 4554 mSDtfsCounter, 15859 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 770 GetRequests, 394 SyntacticMatches, 15 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=590occurred in iteration=30, InterpolantAutomatonStates: 248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 1693 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 32.2s InterpolantComputationTime, 4325 NumberOfCodeBlocks, 4325 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4162 ConstructedInterpolants, 0 QuantifiedInterpolants, 49410 SizeOfPredicates, 0 NumberOfNonLiveVariables, 979 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 35 InterpolantComputations, 33 PerfectInterpolantSequences, 9185/9240 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 16:07:48,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:07:50,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:07:50,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:07:50,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:07:50,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:07:50,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:07:50,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:07:50,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:07:50,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:07:50,867 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:07:50,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:07:50,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:07:50,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:07:50,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:07:50,868 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:07:50,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:07:50,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:07:50,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:07:50,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:07:50,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:07:50,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:07:50,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:07:50,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:07:50,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:07:50,871 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:07:50,871 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:07:50,871 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:07:50,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:07:50,871 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:07:50,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:07:50,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:07:50,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:07:50,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:07:50,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:07:50,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:07:50,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:07:50,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:07:50,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:07:50,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:07:50,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:07:50,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:07:50,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:07:50,874 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:07:50,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:07:50,874 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:07:50,874 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:07:50,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:07:50,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:07:50,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:07:50,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:07:50,875 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d [2025-01-09 16:07:51,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:07:51,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:07:51,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:07:51,216 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:07:51,219 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:07:51,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i