./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.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_fillercode_fillercodestructure_filler-pr-ci_file-42.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 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:04:01,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:04:01,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:04:01,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:04:01,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:04:01,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:04:01,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:04:01,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:04:01,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:04:01,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:04:01,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:04:01,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:04:01,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:04:01,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:04:01,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:04:01,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:04:01,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:04:01,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:04:01,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:04:01,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:04:01,536 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 -> 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 [2025-01-09 11:04:01,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:04:01,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:04:01,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:04:01,778 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:04:01,778 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:04:01,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2025-01-09 11:04:02,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51f44726b/11132424d56c4b34a7880e3f380a0bc3/FLAG092f036e6 [2025-01-09 11:04:03,154 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:04:03,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2025-01-09 11:04:03,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51f44726b/11132424d56c4b34a7880e3f380a0bc3/FLAG092f036e6 [2025-01-09 11:04:03,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51f44726b/11132424d56c4b34a7880e3f380a0bc3 [2025-01-09 11:04:03,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:04:03,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:04:03,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:04:03,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:04:03,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:04:03,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03, skipping insertion in model container [2025-01-09 11:04:03,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:04:03,594 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_fillercode_fillercodestructure_filler-pr-ci_file-42.i[919,932] [2025-01-09 11:04:03,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:04:03,685 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:04:03,693 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_fillercode_fillercodestructure_filler-pr-ci_file-42.i[919,932] [2025-01-09 11:04:03,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:04:03,749 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:04:03,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03 WrapperNode [2025-01-09 11:04:03,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:04:03,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:04:03,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:04:03,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:04:03,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,815 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-01-09 11:04:03,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:04:03,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:04:03,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:04:03,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:04:03,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,858 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 11:04:03,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:04:03,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:04:03,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:04:03,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:04:03,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (1/1) ... [2025-01-09 11:04:03,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:04:03,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:04:03,922 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 11:04:03,926 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 11:04:03,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:04:03,947 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:04:03,947 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:04:03,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:04:03,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:04:03,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:04:04,016 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:04:04,018 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:04:04,366 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-09 11:04:04,366 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:04:04,372 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:04:04,372 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:04:04,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:04:04 BoogieIcfgContainer [2025-01-09 11:04:04,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:04:04,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:04:04,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:04:04,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:04:04,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:04:03" (1/3) ... [2025-01-09 11:04:04,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496c0e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:04:04, skipping insertion in model container [2025-01-09 11:04:04,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:03" (2/3) ... [2025-01-09 11:04:04,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496c0e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:04:04, skipping insertion in model container [2025-01-09 11:04:04,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:04:04" (3/3) ... [2025-01-09 11:04:04,379 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2025-01-09 11:04:04,388 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:04:04,389 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:04:04,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:04:04,439 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;@37b4a424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:04:04,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:04:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 11:04:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 11:04:04,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:04,454 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:04,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:04,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:04,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1609355259, now seen corresponding path program 1 times [2025-01-09 11:04:04,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:04:04,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396948329] [2025-01-09 11:04:04,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:04,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:04:04,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 11:04:04,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 11:04:04,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:04,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 11:04:05,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:04:05,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396948329] [2025-01-09 11:04:05,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396948329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:05,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:04:05,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:04:05,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798769919] [2025-01-09 11:04:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:05,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:04:05,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:04:05,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:04:05,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:04:05,151 INFO L87 Difference]: Start difference. First operand has 71 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:05,314 INFO L93 Difference]: Finished difference Result 200 states and 357 transitions. [2025-01-09 11:04:05,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:04:05,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-01-09 11:04:05,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:05,321 INFO L225 Difference]: With dead ends: 200 [2025-01-09 11:04:05,321 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 11:04:05,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:04:05,326 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:05,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 291 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:04:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 11:04:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2025-01-09 11:04:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 11:04:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-01-09 11:04:05,365 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 129 [2025-01-09 11:04:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:05,366 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-01-09 11:04:05,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-01-09 11:04:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 11:04:05,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:05,372 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:05,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 11:04:05,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:05,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:05,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1134030140, now seen corresponding path program 1 times [2025-01-09 11:04:05,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:04:05,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044253105] [2025-01-09 11:04:05,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:05,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:04:05,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:05,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:05,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:05,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 11:04:05,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:04:05,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044253105] [2025-01-09 11:04:05,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044253105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:05,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:04:05,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:04:05,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110993045] [2025-01-09 11:04:05,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:05,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:04:05,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:04:05,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:04:05,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:04:05,846 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:06,141 INFO L93 Difference]: Finished difference Result 250 states and 367 transitions. [2025-01-09 11:04:06,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:04:06,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-01-09 11:04:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:06,147 INFO L225 Difference]: With dead ends: 250 [2025-01-09 11:04:06,150 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 11:04:06,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:04:06,151 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 166 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:06,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 269 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:04:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 11:04:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 138. [2025-01-09 11:04:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 96 states have internal predecessors, (129), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 11:04:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 205 transitions. [2025-01-09 11:04:06,170 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 205 transitions. Word has length 130 [2025-01-09 11:04:06,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:06,171 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 205 transitions. [2025-01-09 11:04:06,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 205 transitions. [2025-01-09 11:04:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 11:04:06,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:06,174 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:06,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:04:06,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:06,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1527057150, now seen corresponding path program 1 times [2025-01-09 11:04:06,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:04:06,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553125158] [2025-01-09 11:04:06,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:04:06,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:06,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:06,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:06,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 11:04:06,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:04:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553125158] [2025-01-09 11:04:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553125158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:06,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:04:06,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:04:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23797471] [2025-01-09 11:04:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:06,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:04:06,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:04:06,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:04:06,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:04:06,438 INFO L87 Difference]: Start difference. First operand 138 states and 205 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:06,676 INFO L93 Difference]: Finished difference Result 383 states and 587 transitions. [2025-01-09 11:04:06,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:04:06,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-01-09 11:04:06,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:06,680 INFO L225 Difference]: With dead ends: 383 [2025-01-09 11:04:06,680 INFO L226 Difference]: Without dead ends: 287 [2025-01-09 11:04:06,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:04:06,681 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 154 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:06,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 450 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:04:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-01-09 11:04:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 200. [2025-01-09 11:04:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 139 states have internal predecessors, (191), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 11:04:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 303 transitions. [2025-01-09 11:04:06,714 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 303 transitions. Word has length 130 [2025-01-09 11:04:06,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:06,715 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 303 transitions. [2025-01-09 11:04:06,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 303 transitions. [2025-01-09 11:04:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 11:04:06,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:06,717 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:06,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:04:06,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:06,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:06,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1661070656, now seen corresponding path program 1 times [2025-01-09 11:04:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:04:06,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104592076] [2025-01-09 11:04:06,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:06,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:04:06,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:06,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:06,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:06,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 11:04:07,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:04:07,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104592076] [2025-01-09 11:04:07,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104592076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:07,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:04:07,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:04:07,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799366499] [2025-01-09 11:04:07,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:07,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:04:07,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:04:07,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:04:07,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:04:07,104 INFO L87 Difference]: Start difference. First operand 200 states and 303 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:07,293 INFO L93 Difference]: Finished difference Result 322 states and 482 transitions. [2025-01-09 11:04:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:04:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-01-09 11:04:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:07,299 INFO L225 Difference]: With dead ends: 322 [2025-01-09 11:04:07,300 INFO L226 Difference]: Without dead ends: 225 [2025-01-09 11:04:07,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:04:07,301 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 71 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:07,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 386 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:04:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-01-09 11:04:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2025-01-09 11:04:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 137 states have (on average 1.3795620437956204) internal successors, (189), 138 states have internal predecessors, (189), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 11:04:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 301 transitions. [2025-01-09 11:04:07,331 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 301 transitions. Word has length 130 [2025-01-09 11:04:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:07,331 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 301 transitions. [2025-01-09 11:04:07,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 301 transitions. [2025-01-09 11:04:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 11:04:07,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:07,333 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:07,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:04:07,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:07,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:07,334 INFO L85 PathProgramCache]: Analyzing trace with hash -566979068, now seen corresponding path program 1 times [2025-01-09 11:04:07,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:04:07,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996107194] [2025-01-09 11:04:07,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:07,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:04:07,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:07,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:07,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:07,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 11:04:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:04:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996107194] [2025-01-09 11:04:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996107194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:04:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487500757] [2025-01-09 11:04:07,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:07,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:04:07,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:04:07,674 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 11:04:07,675 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 11:04:07,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:07,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:07,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:07,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:07,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 11:04:07,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:04:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-01-09 11:04:08,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:04:08,454 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-01-09 11:04:08,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487500757] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:04:08,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:04:08,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2025-01-09 11:04:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101128927] [2025-01-09 11:04:08,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:04:08,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:04:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:04:08,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:04:08,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:04:08,456 INFO L87 Difference]: Start difference. First operand 199 states and 301 transitions. Second operand has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 4 states have call successors, (43), 3 states have call predecessors, (43), 7 states have return successors, (45), 4 states have call predecessors, (45), 4 states have call successors, (45) [2025-01-09 11:04:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:10,309 INFO L93 Difference]: Finished difference Result 809 states and 1143 transitions. [2025-01-09 11:04:10,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-01-09 11:04:10,310 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 4 states have call successors, (43), 3 states have call predecessors, (43), 7 states have return successors, (45), 4 states have call predecessors, (45), 4 states have call successors, (45) Word has length 130 [2025-01-09 11:04:10,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:10,313 INFO L225 Difference]: With dead ends: 809 [2025-01-09 11:04:10,313 INFO L226 Difference]: Without dead ends: 652 [2025-01-09 11:04:10,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 262 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1470, Invalid=5172, Unknown=0, NotChecked=0, Total=6642 [2025-01-09 11:04:10,316 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 878 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:10,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 635 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:04:10,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-01-09 11:04:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 358. [2025-01-09 11:04:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 262 states have (on average 1.297709923664122) internal successors, (340), 264 states have internal predecessors, (340), 76 states have call successors, (76), 19 states have call predecessors, (76), 19 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 11:04:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 492 transitions. [2025-01-09 11:04:10,361 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 492 transitions. Word has length 130 [2025-01-09 11:04:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:10,362 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 492 transitions. [2025-01-09 11:04:10,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.882352941176471) internal successors, (100), 17 states have internal predecessors, (100), 4 states have call successors, (43), 3 states have call predecessors, (43), 7 states have return successors, (45), 4 states have call predecessors, (45), 4 states have call successors, (45) [2025-01-09 11:04:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 492 transitions. [2025-01-09 11:04:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 11:04:10,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:10,363 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:10,374 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 11:04:10,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:04:10,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:10,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:10,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1059211462, now seen corresponding path program 1 times [2025-01-09 11:04:10,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:04:10,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202466443] [2025-01-09 11:04:10,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:10,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:04:10,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:10,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:10,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:10,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:04:10,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352336503] [2025-01-09 11:04:10,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:10,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:04:10,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:04:10,650 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 11:04:10,651 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 11:04:10,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:10,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:10,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:10,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:10,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 11:04:10,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:04:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-01-09 11:04:11,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:04:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:04:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202466443] [2025-01-09 11:04:20,553 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 11:04:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352336503] [2025-01-09 11:04:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352336503] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:04:20,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:04:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-01-09 11:04:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227999390] [2025-01-09 11:04:20,554 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 11:04:20,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:04:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:04:20,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:04:20,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=96, Unknown=2, NotChecked=0, Total=132 [2025-01-09 11:04:20,555 INFO L87 Difference]: Start difference. First operand 358 states and 492 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 11:04:22,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:22,677 INFO L93 Difference]: Finished difference Result 1038 states and 1429 transitions. [2025-01-09 11:04:22,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 11:04:22,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2025-01-09 11:04:22,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:22,685 INFO L225 Difference]: With dead ends: 1038 [2025-01-09 11:04:22,685 INFO L226 Difference]: Without dead ends: 746 [2025-01-09 11:04:22,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=109, Invalid=269, Unknown=2, NotChecked=0, Total=380 [2025-01-09 11:04:22,686 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 101 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:22,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 503 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 11:04:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-01-09 11:04:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 640. [2025-01-09 11:04:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 472 states have (on average 1.3008474576271187) internal successors, (614), 476 states have internal predecessors, (614), 134 states have call successors, (134), 33 states have call predecessors, (134), 33 states have return successors, (134), 130 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 11:04:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 882 transitions. [2025-01-09 11:04:22,744 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 882 transitions. Word has length 130 [2025-01-09 11:04:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:22,744 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 882 transitions. [2025-01-09 11:04:22,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 11:04:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 882 transitions. [2025-01-09 11:04:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 11:04:22,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:22,745 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:22,752 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 11:04:22,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:04:22,946 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:22,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:22,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1945855814, now seen corresponding path program 1 times [2025-01-09 11:04:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:04:22,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567199322] [2025-01-09 11:04:22,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:22,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:04:22,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 11:04:22,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 11:04:22,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:22,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 11:04:23,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:04:23,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567199322] [2025-01-09 11:04:23,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567199322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:23,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:04:23,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:04:23,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638675783] [2025-01-09 11:04:23,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:23,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:04:23,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:04:23,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:04:23,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:04:23,071 INFO L87 Difference]: Start difference. First operand 640 states and 882 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:23,273 INFO L93 Difference]: Finished difference Result 1046 states and 1435 transitions. [2025-01-09 11:04:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:04:23,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-01-09 11:04:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:23,279 INFO L225 Difference]: With dead ends: 1046 [2025-01-09 11:04:23,279 INFO L226 Difference]: Without dead ends: 758 [2025-01-09 11:04:23,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 11:04:23,281 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 29 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:23,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 180 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:04:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-01-09 11:04:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 669. [2025-01-09 11:04:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 498 states have (on average 1.2971887550200802) internal successors, (646), 503 states have internal predecessors, (646), 136 states have call successors, (136), 34 states have call predecessors, (136), 34 states have return successors, (136), 131 states have call predecessors, (136), 136 states have call successors, (136) [2025-01-09 11:04:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 918 transitions. [2025-01-09 11:04:23,351 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 918 transitions. Word has length 131 [2025-01-09 11:04:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:23,352 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 918 transitions. [2025-01-09 11:04:23,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 918 transitions. [2025-01-09 11:04:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 11:04:23,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:23,354 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:23,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:04:23,354 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:23,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1956084472, now seen corresponding path program 1 times [2025-01-09 11:04:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:04:23,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102975710] [2025-01-09 11:04:23,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:23,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:04:23,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 11:04:23,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 11:04:23,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:23,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 11:04:23,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:04:23,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102975710] [2025-01-09 11:04:23,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102975710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:23,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:04:23,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:04:23,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301107101] [2025-01-09 11:04:23,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:23,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:04:23,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:04:23,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:04:23,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:04:23,506 INFO L87 Difference]: Start difference. First operand 669 states and 918 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:23,619 INFO L93 Difference]: Finished difference Result 1266 states and 1742 transitions. [2025-01-09 11:04:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:04:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-01-09 11:04:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:23,623 INFO L225 Difference]: With dead ends: 1266 [2025-01-09 11:04:23,623 INFO L226 Difference]: Without dead ends: 669 [2025-01-09 11:04:23,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 11:04:23,624 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:23,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:04:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-01-09 11:04:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 663. [2025-01-09 11:04:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 492 states have (on average 1.2703252032520325) internal successors, (625), 497 states have internal predecessors, (625), 136 states have call successors, (136), 34 states have call predecessors, (136), 34 states have return successors, (136), 131 states have call predecessors, (136), 136 states have call successors, (136) [2025-01-09 11:04:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 897 transitions. [2025-01-09 11:04:23,661 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 897 transitions. Word has length 131 [2025-01-09 11:04:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:23,661 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 897 transitions. [2025-01-09 11:04:23,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 897 transitions. [2025-01-09 11:04:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 11:04:23,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:23,663 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:23,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:04:23,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:23,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:23,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1637818246, now seen corresponding path program 1 times [2025-01-09 11:04:23,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:04:23,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858888043] [2025-01-09 11:04:23,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:23,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:04:23,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 11:04:23,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 11:04:23,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:23,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:04:23,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1013113358] [2025-01-09 11:04:23,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:23,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:04:23,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:04:23,696 INFO L229 MonitoredProcess]: Starting monitored process 4 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 11:04:23,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 11:04:23,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 11:04:23,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 11:04:23,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:23,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:04:23,780 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:04:23,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 11:04:23,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 11:04:23,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:23,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:04:23,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:04:23,889 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:04:23,890 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:04:23,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 11:04:24,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:04:24,099 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:04:24,170 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:04:24,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:04:24 BoogieIcfgContainer [2025-01-09 11:04:24,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:04:24,173 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:04:24,173 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:04:24,173 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:04:24,174 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:04:04" (3/4) ... [2025-01-09 11:04:24,175 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:04:24,176 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:04:24,176 INFO L158 Benchmark]: Toolchain (without parser) took 20702.70ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 111.5MB in the beginning and 297.0MB in the end (delta: -185.5MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2025-01-09 11:04:24,176 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:04:24,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.70ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 96.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:04:24,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.37ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 92.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:04:24,177 INFO L158 Benchmark]: Boogie Preprocessor took 73.84ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 85.9MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:04:24,177 INFO L158 Benchmark]: RCFGBuilder took 481.80ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 60.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 11:04:24,177 INFO L158 Benchmark]: TraceAbstraction took 19798.21ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 59.8MB in the beginning and 297.1MB in the end (delta: -237.3MB). Peak memory consumption was 149.5MB. Max. memory is 16.1GB. [2025-01-09 11:04:24,177 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 352.3MB. Free memory was 297.1MB in the beginning and 297.0MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:04:24,178 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.70ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 96.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.37ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 92.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.84ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 85.9MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 481.80ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 60.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19798.21ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 59.8MB in the beginning and 297.1MB in the end (delta: -237.3MB). Peak memory consumption was 149.5MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 352.3MB. Free memory was 297.1MB in the beginning and 297.0MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] float var_1_26 = 500.65; [L38] float var_1_30 = 9.8; [L39] unsigned char var_1_31 = 4; [L40] unsigned short int var_1_34 = 1; [L41] unsigned long int var_1_35 = 10; [L42] unsigned char var_1_36 = 10; [L43] unsigned char var_1_38 = 16; [L44] unsigned char var_1_39 = 0; [L45] unsigned short int var_1_40 = 10; [L46] unsigned short int var_1_41 = 128; [L47] unsigned short int var_1_42 = 40597; [L48] signed short int last_1_var_1_1 = 16; [L49] unsigned char last_1_var_1_6 = 10; [L50] unsigned char last_1_var_1_8 = 1; [L51] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L184] CALL updateLastVariables() [L171] last_1_var_1_1 = var_1_1 [L172] last_1_var_1_6 = var_1_6 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L184] RET updateLastVariables() [L185] CALL updateVariables() [L141] var_1_5 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L142] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L143] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L143] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=128, var_1_8=1] [L144] var_1_7 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L145] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L146] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L146] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L150] var_1_12 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L151] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L152] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L154] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L155] var_1_16 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L156] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L157] var_1_20 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L158] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L159] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L160] var_1_38 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L161] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L162] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L163] var_1_39 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L164] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L165] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L166] var_1_42 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L167] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L168] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] signed long int stepLocal_6 = last_1_var_1_1; [L56] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L57] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L58] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L61] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L66] COND TRUE (- var_1_15) < ((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))) [L67] var_1_30 = var_1_15 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L69] COND TRUE \read(var_1_11) [L70] var_1_35 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=227, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L72] COND TRUE \read(var_1_11) [L73] var_1_36 = (var_1_7 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L77] COND FALSE !(var_1_7 <= (~ var_1_6)) [L82] var_1_41 = var_1_6 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L84] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=10, var_1_7=227, var_1_8=1] [L87] COND TRUE var_1_5 >= -2 [L88] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L90] COND TRUE ((((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) < (var_1_5)) ? (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) : (var_1_5))) <= var_1_13 [L91] var_1_31 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L93] COND TRUE (- var_1_6) != var_1_7 [L94] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L96] unsigned char stepLocal_4 = var_1_6; [L97] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=127, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L98] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=127, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L99] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L100] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L107] COND FALSE !(((var_1_7 + 25) % var_1_7) < 2) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L110] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=127, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L111] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L114] COND FALSE !(var_1_7 < ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L117] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L118] COND TRUE \read(var_1_19) [L119] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L125] COND TRUE var_1_12 || var_1_19 [L126] var_1_21 = ((var_1_6 > -4) || var_1_11) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L128] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L129] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, stepLocal_1=227, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=1] [L130] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L137] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=127, stepLocal_1=227, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=0] [L186] RET step() [L187] CALL, EXPR property() [L177-L178] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=0] [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=227, var_1_34=1, var_1_35=227, var_1_36=227, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=8, var_1_6=127, var_1_7=227, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 9, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1507 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1506 mSDsluCounter, 2898 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2007 mSDsCounter, 371 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1874 IncrementalHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 371 mSolverCounterUnsat, 891 mSDtfsCounter, 1874 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 553 GetRequests, 433 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2234 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=669occurred in iteration=7, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 686 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 1563 NumberOfCodeBlocks, 1563 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1291 ConstructedInterpolants, 0 QuantifiedInterpolants, 4046 SizeOfPredicates, 6 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 5937/6120 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 11:04:24,391 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-01-09 11:04:24,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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_fillercode_fillercodestructure_filler-pr-ci_file-42.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 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:04:26,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:04:26,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:04:26,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:04:26,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:04:26,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:04:26,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:04:26,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:04:26,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:04:26,811 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:04:26,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:04:26,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:04:26,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:04:26,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:04:26,812 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:04:26,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:04:26,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:04:26,813 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:04:26,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:04:26,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:04:26,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:04:26,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:04:26,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:04:26,813 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:04:26,813 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:04:26,813 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:04:26,814 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:04:26,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:04:26,814 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:04:26,814 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:04:26,814 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:04:26,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:04:26,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:04:26,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:04:26,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:04:26,815 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 -> 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 [2025-01-09 11:04:27,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:04:27,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:04:27,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:04:27,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:04:27,087 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:04:27,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2025-01-09 11:04:28,279 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/302ea35bf/6622137aa50644839a551c84fbb5d2ca/FLAG95c9e5ef0 [2025-01-09 11:04:28,495 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:04:28,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2025-01-09 11:04:28,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/302ea35bf/6622137aa50644839a551c84fbb5d2ca/FLAG95c9e5ef0 [2025-01-09 11:04:28,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/302ea35bf/6622137aa50644839a551c84fbb5d2ca [2025-01-09 11:04:28,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:04:28,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:04:28,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:04:28,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:04:28,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:04:28,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:04:28" (1/1) ... [2025-01-09 11:04:28,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25edb703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:28, skipping insertion in model container [2025-01-09 11:04:28,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:04:28" (1/1) ... [2025-01-09 11:04:28,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:04:28,986 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_fillercode_fillercodestructure_filler-pr-ci_file-42.i[919,932] [2025-01-09 11:04:29,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:04:29,067 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:04:29,076 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_fillercode_fillercodestructure_filler-pr-ci_file-42.i[919,932] [2025-01-09 11:04:29,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:04:29,118 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:04:29,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29 WrapperNode [2025-01-09 11:04:29,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:04:29,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:04:29,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:04:29,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:04:29,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,151 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-01-09 11:04:29,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:04:29,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:04:29,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:04:29,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:04:29,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,170 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 11:04:29,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:04:29,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:04:29,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:04:29,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:04:29,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (1/1) ... [2025-01-09 11:04:29,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:04:29,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:04:29,225 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 11:04:29,229 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 11:04:29,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:04:29,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:04:29,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:04:29,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:04:29,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:04:29,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:04:29,321 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:04:29,323 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:04:29,746 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-09 11:04:29,746 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:04:29,753 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:04:29,753 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:04:29,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:04:29 BoogieIcfgContainer [2025-01-09 11:04:29,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:04:29,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:04:29,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:04:29,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:04:29,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:04:28" (1/3) ... [2025-01-09 11:04:29,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132e2617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:04:29, skipping insertion in model container [2025-01-09 11:04:29,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:04:29" (2/3) ... [2025-01-09 11:04:29,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132e2617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:04:29, skipping insertion in model container [2025-01-09 11:04:29,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:04:29" (3/3) ... [2025-01-09 11:04:29,760 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2025-01-09 11:04:29,769 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:04:29,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:04:29,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:04:29,818 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;@6d231991, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:04:29,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:04:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 11:04:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 11:04:29,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:29,831 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:29,832 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:29,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1609355259, now seen corresponding path program 1 times [2025-01-09 11:04:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:04:29,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753027214] [2025-01-09 11:04:29,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:29,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:29,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:04:29,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:04:29,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 11:04:29,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 11:04:30,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 11:04:30,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:30,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:30,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 11:04:30,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:04:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 11:04:30,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:04:30,374 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:04:30,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753027214] [2025-01-09 11:04:30,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753027214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:30,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:04:30,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:04:30,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313666457] [2025-01-09 11:04:30,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:30,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:04:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:04:30,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:04:30,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:04:30,394 INFO L87 Difference]: Start difference. First operand has 71 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:30,724 INFO L93 Difference]: Finished difference Result 200 states and 357 transitions. [2025-01-09 11:04:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:04:30,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-01-09 11:04:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:30,736 INFO L225 Difference]: With dead ends: 200 [2025-01-09 11:04:30,736 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 11:04:30,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:04:30,739 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 104 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:30,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 291 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:04:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 11:04:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2025-01-09 11:04:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 11:04:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-01-09 11:04:30,800 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 129 [2025-01-09 11:04:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:30,802 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-01-09 11:04:30,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-01-09 11:04:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 11:04:30,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:30,807 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:30,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 11:04:31,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:31,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:31,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:31,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1134030140, now seen corresponding path program 1 times [2025-01-09 11:04:31,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:04:31,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937532068] [2025-01-09 11:04:31,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:31,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:31,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:04:31,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:04:31,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 11:04:31,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:31,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:31,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:31,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:31,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 11:04:31,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:04:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 11:04:31,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:04:31,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:04:31,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937532068] [2025-01-09 11:04:31,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937532068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:31,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:04:31,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:04:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980021779] [2025-01-09 11:04:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:31,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:04:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:04:31,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:04:31,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:04:31,767 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:32,392 INFO L93 Difference]: Finished difference Result 293 states and 459 transitions. [2025-01-09 11:04:32,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:04:32,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-01-09 11:04:32,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:32,402 INFO L225 Difference]: With dead ends: 293 [2025-01-09 11:04:32,402 INFO L226 Difference]: Without dead ends: 229 [2025-01-09 11:04:32,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:04:32,404 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 150 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:32,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 448 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:04:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-01-09 11:04:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 164. [2025-01-09 11:04:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 106 states have internal predecessors, (144), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 11:04:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 252 transitions. [2025-01-09 11:04:32,433 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 252 transitions. Word has length 130 [2025-01-09 11:04:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:32,433 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 252 transitions. [2025-01-09 11:04:32,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 252 transitions. [2025-01-09 11:04:32,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 11:04:32,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:32,435 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:32,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 11:04:32,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:32,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:32,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1268043646, now seen corresponding path program 1 times [2025-01-09 11:04:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:04:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463714403] [2025-01-09 11:04:32,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:32,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:32,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:04:32,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:04:32,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 11:04:32,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:32,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:32,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:32,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:32,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:04:32,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:04:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 11:04:32,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:04:32,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:04:32,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463714403] [2025-01-09 11:04:32,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463714403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:32,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:04:32,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:04:32,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947348923] [2025-01-09 11:04:32,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:32,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:04:32,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:04:32,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:04:32,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:04:32,907 INFO L87 Difference]: Start difference. First operand 164 states and 252 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:33,008 INFO L93 Difference]: Finished difference Result 290 states and 449 transitions. [2025-01-09 11:04:33,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:04:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-01-09 11:04:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:33,019 INFO L225 Difference]: With dead ends: 290 [2025-01-09 11:04:33,021 INFO L226 Difference]: Without dead ends: 164 [2025-01-09 11:04:33,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 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 11:04:33,024 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:33,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:04:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-09 11:04:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-01-09 11:04:33,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 11:04:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 250 transitions. [2025-01-09 11:04:33,049 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 250 transitions. Word has length 130 [2025-01-09 11:04:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:33,049 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 250 transitions. [2025-01-09 11:04:33,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 250 transitions. [2025-01-09 11:04:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 11:04:33,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:33,053 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:33,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 11:04:33,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:33,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:33,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:33,254 INFO L85 PathProgramCache]: Analyzing trace with hash -566979068, now seen corresponding path program 1 times [2025-01-09 11:04:33,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:04:33,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238291011] [2025-01-09 11:04:33,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:33,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:33,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:04:33,257 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:04:33,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 11:04:33,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:33,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:33,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:33,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:33,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 11:04:33,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:04:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-01-09 11:04:33,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:04:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-01-09 11:04:33,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:04:33,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238291011] [2025-01-09 11:04:33,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238291011] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:04:33,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:04:33,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-01-09 11:04:33,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264947794] [2025-01-09 11:04:33,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:04:33,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 11:04:33,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:04:33,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 11:04:33,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:04:33,930 INFO L87 Difference]: Start difference. First operand 164 states and 250 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 11:04:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:34,542 INFO L93 Difference]: Finished difference Result 427 states and 619 transitions. [2025-01-09 11:04:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 11:04:34,543 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 130 [2025-01-09 11:04:34,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:34,545 INFO L225 Difference]: With dead ends: 427 [2025-01-09 11:04:34,545 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 11:04:34,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 11:04:34,546 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 339 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:34,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 379 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:04:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 11:04:34,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 275. [2025-01-09 11:04:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 190 states have (on average 1.3210526315789475) internal successors, (251), 190 states have internal predecessors, (251), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 11:04:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 395 transitions. [2025-01-09 11:04:34,583 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 395 transitions. Word has length 130 [2025-01-09 11:04:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:34,583 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 395 transitions. [2025-01-09 11:04:34,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-01-09 11:04:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 395 transitions. [2025-01-09 11:04:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 11:04:34,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:34,585 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:34,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 11:04:34,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:34,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:34,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2039044486, now seen corresponding path program 1 times [2025-01-09 11:04:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:04:34,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688016597] [2025-01-09 11:04:34,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:34,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:34,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:04:34,788 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:04:34,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 11:04:34,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:34,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:34,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:34,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:34,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 11:04:35,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:04:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-01-09 11:04:35,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:04:35,820 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:04:35,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688016597] [2025-01-09 11:04:35,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688016597] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:04:35,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1936514183] [2025-01-09 11:04:35,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:35,821 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:04:35,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:04:35,845 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 11:04:35,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-01-09 11:04:35,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:36,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:36,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:36,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:36,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 11:04:36,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:04:36,770 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 11:04:36,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:04:36,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1936514183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:36,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:04:36,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-01-09 11:04:36,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434038677] [2025-01-09 11:04:36,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:36,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:04:36,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:04:36,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:04:36,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:04:36,773 INFO L87 Difference]: Start difference. First operand 275 states and 395 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:38,496 INFO L93 Difference]: Finished difference Result 854 states and 1222 transitions. [2025-01-09 11:04:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 11:04:38,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-01-09 11:04:38,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:38,499 INFO L225 Difference]: With dead ends: 854 [2025-01-09 11:04:38,499 INFO L226 Difference]: Without dead ends: 633 [2025-01-09 11:04:38,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:04:38,500 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 160 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:38,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 459 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 11:04:38,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-01-09 11:04:38,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 545. [2025-01-09 11:04:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 391 states have (on average 1.319693094629156) internal successors, (516), 393 states have internal predecessors, (516), 130 states have call successors, (130), 23 states have call predecessors, (130), 23 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2025-01-09 11:04:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 776 transitions. [2025-01-09 11:04:38,560 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 776 transitions. Word has length 130 [2025-01-09 11:04:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:38,561 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 776 transitions. [2025-01-09 11:04:38,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 776 transitions. [2025-01-09 11:04:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 11:04:38,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:38,563 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:38,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-01-09 11:04:38,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 11:04:38,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:38,967 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:38,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash 44899780, now seen corresponding path program 1 times [2025-01-09 11:04:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:04:38,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981178691] [2025-01-09 11:04:38,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:38,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:38,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:04:38,973 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:04:38,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 11:04:39,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:39,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:39,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:39,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:39,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 11:04:39,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:04:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-01-09 11:04:39,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:04:39,667 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:04:39,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981178691] [2025-01-09 11:04:39,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981178691] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:04:39,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [294443179] [2025-01-09 11:04:39,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:39,668 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:04:39,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:04:39,670 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 11:04:39,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-01-09 11:04:39,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 11:04:40,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 11:04:40,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:40,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:40,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 11:04:40,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:04:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 11:04:40,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:04:40,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [294443179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:04:40,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:04:40,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-01-09 11:04:40,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574568712] [2025-01-09 11:04:40,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:40,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:04:40,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:04:40,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:04:40,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:04:40,609 INFO L87 Difference]: Start difference. First operand 545 states and 776 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:42,132 INFO L93 Difference]: Finished difference Result 1146 states and 1634 transitions. [2025-01-09 11:04:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:04:42,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-01-09 11:04:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:42,137 INFO L225 Difference]: With dead ends: 1146 [2025-01-09 11:04:42,137 INFO L226 Difference]: Without dead ends: 735 [2025-01-09 11:04:42,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:04:42,139 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 93 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:42,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 399 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 11:04:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-01-09 11:04:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 684. [2025-01-09 11:04:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 488 states have (on average 1.3114754098360655) internal successors, (640), 490 states have internal predecessors, (640), 166 states have call successors, (166), 29 states have call predecessors, (166), 29 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2025-01-09 11:04:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 972 transitions. [2025-01-09 11:04:42,190 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 972 transitions. Word has length 130 [2025-01-09 11:04:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:42,191 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 972 transitions. [2025-01-09 11:04:42,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:42,191 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 972 transitions. [2025-01-09 11:04:42,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 11:04:42,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:42,192 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:42,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 11:04:42,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-01-09 11:04:42,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 11:04:42,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:42,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:42,597 INFO L85 PathProgramCache]: Analyzing trace with hash -657985222, now seen corresponding path program 1 times [2025-01-09 11:04:42,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:04:42,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985296420] [2025-01-09 11:04:42,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:42,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:42,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:04:42,602 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:04:42,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 11:04:42,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 11:04:42,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 11:04:42,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:42,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:42,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 11:04:42,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:04:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-01-09 11:04:42,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:04:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 11:04:43,194 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:04:43,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985296420] [2025-01-09 11:04:43,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985296420] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 11:04:43,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:04:43,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 11:04:43,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129290839] [2025-01-09 11:04:43,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:04:43,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:04:43,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:04:43,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:04:43,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:04:43,195 INFO L87 Difference]: Start difference. First operand 684 states and 972 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:43,924 INFO L93 Difference]: Finished difference Result 1354 states and 1869 transitions. [2025-01-09 11:04:43,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:04:43,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-01-09 11:04:43,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:43,930 INFO L225 Difference]: With dead ends: 1354 [2025-01-09 11:04:43,931 INFO L226 Difference]: Without dead ends: 1141 [2025-01-09 11:04:43,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:04:43,932 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 83 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:43,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 203 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:04:43,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-01-09 11:04:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 835. [2025-01-09 11:04:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 620 states have (on average 1.303225806451613) internal successors, (808), 628 states have internal predecessors, (808), 178 states have call successors, (178), 36 states have call predecessors, (178), 36 states have return successors, (178), 170 states have call predecessors, (178), 178 states have call successors, (178) [2025-01-09 11:04:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1164 transitions. [2025-01-09 11:04:44,011 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1164 transitions. Word has length 131 [2025-01-09 11:04:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:44,011 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1164 transitions. [2025-01-09 11:04:44,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 11:04:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1164 transitions. [2025-01-09 11:04:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 11:04:44,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:44,013 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:44,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-01-09 11:04:44,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:44,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:44,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:44,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1051012232, now seen corresponding path program 1 times [2025-01-09 11:04:44,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:04:44,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152783033] [2025-01-09 11:04:44,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:44,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:44,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:04:44,217 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:04:44,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-01-09 11:04:44,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 11:04:44,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 11:04:44,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:44,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:44,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 11:04:44,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:04:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-01-09 11:04:44,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:04:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 11:04:45,618 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:04:45,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152783033] [2025-01-09 11:04:45,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152783033] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:04:45,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:04:45,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-01-09 11:04:45,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774674324] [2025-01-09 11:04:45,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:04:45,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:04:45,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:04:45,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:04:45,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:04:45,620 INFO L87 Difference]: Start difference. First operand 835 states and 1164 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-01-09 11:04:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:04:45,967 INFO L93 Difference]: Finished difference Result 1565 states and 2130 transitions. [2025-01-09 11:04:45,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:04:45,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 131 [2025-01-09 11:04:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:04:45,971 INFO L225 Difference]: With dead ends: 1565 [2025-01-09 11:04:45,971 INFO L226 Difference]: Without dead ends: 797 [2025-01-09 11:04:45,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:04:45,973 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:04:45,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 161 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:04:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-01-09 11:04:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 721. [2025-01-09 11:04:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 513 states have (on average 1.2378167641325537) internal successors, (635), 513 states have internal predecessors, (635), 162 states have call successors, (162), 45 states have call predecessors, (162), 45 states have return successors, (162), 162 states have call predecessors, (162), 162 states have call successors, (162) [2025-01-09 11:04:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 959 transitions. [2025-01-09 11:04:46,027 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 959 transitions. Word has length 131 [2025-01-09 11:04:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:04:46,027 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 959 transitions. [2025-01-09 11:04:46,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-01-09 11:04:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 959 transitions. [2025-01-09 11:04:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 11:04:46,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:04:46,029 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:04:46,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-01-09 11:04:46,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:46,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:04:46,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:04:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1637818246, now seen corresponding path program 1 times [2025-01-09 11:04:46,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:04:46,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526516943] [2025-01-09 11:04:46,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:04:46,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:04:46,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:04:46,237 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:04:46,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-01-09 11:04:46,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 11:04:46,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 11:04:46,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:04:46,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:04:46,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 11:04:46,430 INFO L279 TraceCheckSpWp]: Computing forward predicates...