./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.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-70.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 8f42b3e590c3342934300a63742dfb4f9c28cfc7e02ac6f0af20972824a6c5c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:08:00,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:08:00,400 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:08:00,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:08:00,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:08:00,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:08:00,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:08:00,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:08:00,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:08:00,423 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:08:00,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:08:00,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:08:00,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:08:00,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:08:00,424 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:08:00,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:08:00,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:08:00,424 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:08:00,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:08:00,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:08:00,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:08:00,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:08:00,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:08:00,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:08:00,425 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:08:00,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:08:00,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:08:00,425 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:08:00,425 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:08:00,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:08:00,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:08:00,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:08:00,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:08:00,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:08:00,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:08:00,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:08:00,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:08:00,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:08:00,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:08:00,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:08:00,426 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:08:00,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:08:00,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:08:00,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:08:00,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:08:00,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:08:00,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:08:00,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:08:00,427 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 -> 8f42b3e590c3342934300a63742dfb4f9c28cfc7e02ac6f0af20972824a6c5c3 [2025-01-09 11:08:00,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:08:00,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:08:00,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:08:00,678 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:08:00,678 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:08:00,679 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-70.i [2025-01-09 11:08:01,916 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43b696dd3/5e5c08c166f647c6b5de3f663c225049/FLAG5b09fa4f9 [2025-01-09 11:08:02,184 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:08:02,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i [2025-01-09 11:08:02,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43b696dd3/5e5c08c166f647c6b5de3f663c225049/FLAG5b09fa4f9 [2025-01-09 11:08:02,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43b696dd3/5e5c08c166f647c6b5de3f663c225049 [2025-01-09 11:08:02,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:08:02,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:08:02,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:08:02,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:08:02,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:08:02,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3d89a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02, skipping insertion in model container [2025-01-09 11:08:02,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:08:02,661 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-70.i[919,932] [2025-01-09 11:08:02,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:08:02,734 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:08:02,741 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-70.i[919,932] [2025-01-09 11:08:02,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:08:02,790 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:08:02,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02 WrapperNode [2025-01-09 11:08:02,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:08:02,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:08:02,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:08:02,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:08:02,796 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:08:02" (1/1) ... [2025-01-09 11:08:02,805 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:08:02" (1/1) ... [2025-01-09 11:08:02,842 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-01-09 11:08:02,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:08:02,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:08:02,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:08:02,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:08:02,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,881 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:08:02,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:08:02,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:08:02,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:08:02,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:08:02,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02" (1/1) ... [2025-01-09 11:08:02,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:08:02,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:08:02,935 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:08:02,940 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:08:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:08:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:08:02,953 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:08:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:08:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:08:02,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:08:03,015 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:08:03,017 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:08:03,262 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 11:08:03,264 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:08:03,277 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:08:03,277 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:08:03,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:08:03 BoogieIcfgContainer [2025-01-09 11:08:03,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:08:03,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:08:03,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:08:03,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:08:03,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:08:02" (1/3) ... [2025-01-09 11:08:03,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2f8a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:08:03, skipping insertion in model container [2025-01-09 11:08:03,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:02" (2/3) ... [2025-01-09 11:08:03,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2f8a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:08:03, skipping insertion in model container [2025-01-09 11:08:03,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:08:03" (3/3) ... [2025-01-09 11:08:03,287 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i [2025-01-09 11:08:03,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:08:03,301 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:08:03,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:08:03,359 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;@7e344798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:08:03,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:08:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 11:08:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 11:08:03,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:03,372 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:03,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:03,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:03,376 INFO L85 PathProgramCache]: Analyzing trace with hash 927649356, now seen corresponding path program 1 times [2025-01-09 11:08:03,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:03,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139979174] [2025-01-09 11:08:03,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:03,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:03,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 11:08:03,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 11:08:03,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:03,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 11:08:03,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:03,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139979174] [2025-01-09 11:08:03,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139979174] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:08:03,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859929781] [2025-01-09 11:08:03,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:03,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:08:03,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:08:03,619 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:08:03,621 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:08:03,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 11:08:03,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 11:08:03,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:03,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:03,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:08:03,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:08:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 11:08:03,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:08:03,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859929781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:03,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:08:03,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:08:03,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205837721] [2025-01-09 11:08:03,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:03,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:08:03,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:03,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:08:03,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:08:03,773 INFO L87 Difference]: Start difference. First operand has 70 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 11:08:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:03,804 INFO L93 Difference]: Finished difference Result 134 states and 226 transitions. [2025-01-09 11:08:03,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:08:03,805 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2025-01-09 11:08:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:03,809 INFO L225 Difference]: With dead ends: 134 [2025-01-09 11:08:03,809 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 11:08:03,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:08:03,817 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:03,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:08:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 11:08:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 11:08:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 11:08:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-01-09 11:08:03,843 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 109 [2025-01-09 11:08:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:03,843 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-01-09 11:08:03,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 11:08:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-01-09 11:08:03,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 11:08:03,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:03,846 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:03,852 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:08:04,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 11:08:04,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:04,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash 155677000, now seen corresponding path program 1 times [2025-01-09 11:08:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:04,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120638768] [2025-01-09 11:08:04,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:04,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:04,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 11:08:04,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 11:08:04,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:04,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 11:08:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:04,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120638768] [2025-01-09 11:08:04,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120638768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:04,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:08:04,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:08:04,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715988820] [2025-01-09 11:08:04,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:04,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:08:04,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:04,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:08:04,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:08:04,218 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 11:08:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:04,279 INFO L93 Difference]: Finished difference Result 174 states and 261 transitions. [2025-01-09 11:08:04,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:08:04,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-01-09 11:08:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:04,283 INFO L225 Difference]: With dead ends: 174 [2025-01-09 11:08:04,283 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 11:08:04,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:08:04,285 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 60 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:04,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 207 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:08:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 11:08:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2025-01-09 11:08:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 11:08:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 160 transitions. [2025-01-09 11:08:04,303 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 160 transitions. Word has length 109 [2025-01-09 11:08:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:04,306 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 160 transitions. [2025-01-09 11:08:04,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 11:08:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 160 transitions. [2025-01-09 11:08:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 11:08:04,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:04,308 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:04,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:08:04,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:04,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:04,309 INFO L85 PathProgramCache]: Analyzing trace with hash -661971450, now seen corresponding path program 1 times [2025-01-09 11:08:04,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:04,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690021795] [2025-01-09 11:08:04,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:04,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:04,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 11:08:04,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 11:08:04,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:04,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 11:08:04,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:04,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690021795] [2025-01-09 11:08:04,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690021795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:04,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:08:04,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:08:04,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102936800] [2025-01-09 11:08:04,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:04,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:08:04,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:04,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:08:04,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:08:04,753 INFO L87 Difference]: Start difference. First operand 107 states and 160 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 11:08:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:04,865 INFO L93 Difference]: Finished difference Result 313 states and 456 transitions. [2025-01-09 11:08:04,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:08:04,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-01-09 11:08:04,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:04,868 INFO L225 Difference]: With dead ends: 313 [2025-01-09 11:08:04,869 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 11:08:04,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:08:04,871 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 183 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:04,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 366 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:08:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 11:08:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 149. [2025-01-09 11:08:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 114 states have (on average 1.368421052631579) internal successors, (156), 114 states have internal predecessors, (156), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 11:08:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 216 transitions. [2025-01-09 11:08:04,896 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 216 transitions. Word has length 109 [2025-01-09 11:08:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:04,897 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 216 transitions. [2025-01-09 11:08:04,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 11:08:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 216 transitions. [2025-01-09 11:08:04,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 11:08:04,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:04,899 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:04,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:08:04,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:04,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:04,902 INFO L85 PathProgramCache]: Analyzing trace with hash 39093128, now seen corresponding path program 1 times [2025-01-09 11:08:04,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:04,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821141230] [2025-01-09 11:08:04,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:04,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:04,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 11:08:05,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 11:08:05,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:05,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 11:08:05,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:05,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821141230] [2025-01-09 11:08:05,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821141230] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:08:05,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095029084] [2025-01-09 11:08:05,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:05,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:08:05,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:08:05,237 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:08:05,239 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:08:05,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 11:08:05,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 11:08:05,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:05,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:05,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 11:08:05,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:08:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 11:08:05,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:08:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 11:08:05,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095029084] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:08:05,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:08:05,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 11:08:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442893807] [2025-01-09 11:08:05,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:08:05,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:08:05,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:05,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:08:05,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:08:05,584 INFO L87 Difference]: Start difference. First operand 149 states and 216 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 11:08:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:05,717 INFO L93 Difference]: Finished difference Result 287 states and 409 transitions. [2025-01-09 11:08:05,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:08:05,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 109 [2025-01-09 11:08:05,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:05,722 INFO L225 Difference]: With dead ends: 287 [2025-01-09 11:08:05,723 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 11:08:05,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:08:05,724 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 62 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:05,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 189 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:08:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 11:08:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-01-09 11:08:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 100 states have (on average 1.3) internal successors, (130), 100 states have internal predecessors, (130), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 11:08:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 190 transitions. [2025-01-09 11:08:05,744 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 190 transitions. Word has length 109 [2025-01-09 11:08:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:05,745 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 190 transitions. [2025-01-09 11:08:05,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 11:08:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 190 transitions. [2025-01-09 11:08:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 11:08:05,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:05,747 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:05,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 11:08:05,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:08:05,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:05,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:05,950 INFO L85 PathProgramCache]: Analyzing trace with hash 558801679, now seen corresponding path program 1 times [2025-01-09 11:08:05,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:05,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540971425] [2025-01-09 11:08:05,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:05,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:05,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 11:08:06,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 11:08:06,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:06,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 11:08:06,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:08:06,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540971425] [2025-01-09 11:08:06,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540971425] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:08:06,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864607969] [2025-01-09 11:08:06,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:06,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:08:06,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:08:06,819 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:08:06,824 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:08:06,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 11:08:07,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 11:08:07,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:07,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:07,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 11:08:07,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:08:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 173 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 11:08:08,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:08:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 66 proven. 15 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-09 11:08:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864607969] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:08:10,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:08:10,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 32 [2025-01-09 11:08:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647593331] [2025-01-09 11:08:10,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:08:10,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 11:08:10,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:08:10,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 11:08:10,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2025-01-09 11:08:10,022 INFO L87 Difference]: Start difference. First operand 137 states and 190 transitions. Second operand has 32 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 30 states have internal predecessors, (108), 8 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) [2025-01-09 11:08:19,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:08:20,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:08:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:22,188 INFO L93 Difference]: Finished difference Result 1072 states and 1427 transitions. [2025-01-09 11:08:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-01-09 11:08:22,188 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 30 states have internal predecessors, (108), 8 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) Word has length 110 [2025-01-09 11:08:22,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:22,193 INFO L225 Difference]: With dead ends: 1072 [2025-01-09 11:08:22,193 INFO L226 Difference]: Without dead ends: 938 [2025-01-09 11:08:22,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3987 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2487, Invalid=9285, Unknown=0, NotChecked=0, Total=11772 [2025-01-09 11:08:22,198 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1417 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 3696 mSolverCounterSat, 668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 4364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 668 IncrementalHoareTripleChecker+Valid, 3696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:22,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 2324 Invalid, 4364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [668 Valid, 3696 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-01-09 11:08:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-01-09 11:08:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 553. [2025-01-09 11:08:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 392 states have (on average 1.2168367346938775) internal successors, (477), 395 states have internal predecessors, (477), 123 states have call successors, (123), 37 states have call predecessors, (123), 37 states have return successors, (123), 120 states have call predecessors, (123), 123 states have call successors, (123) [2025-01-09 11:08:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 723 transitions. [2025-01-09 11:08:22,298 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 723 transitions. Word has length 110 [2025-01-09 11:08:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:22,299 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 723 transitions. [2025-01-09 11:08:22,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 30 states have internal predecessors, (108), 8 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) [2025-01-09 11:08:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 723 transitions. [2025-01-09 11:08:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 11:08:22,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:22,301 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:22,308 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:08:22,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:08:22,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:22,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:22,507 INFO L85 PathProgramCache]: Analyzing trace with hash -462266675, now seen corresponding path program 1 times [2025-01-09 11:08:22,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:08:22,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767650099] [2025-01-09 11:08:22,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:22,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:08:22,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 11:08:22,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 11:08:22,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:22,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:08:22,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823083222] [2025-01-09 11:08:22,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:08:22,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:08:22,604 INFO L229 MonitoredProcess]: Starting monitored process 5 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:08:22,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 11:08:22,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 11:08:22,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 11:08:22,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:22,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:08:22,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:08:22,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 11:08:22,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 11:08:22,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:22,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:08:22,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:08:22,830 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:08:22,831 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:08:22,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 11:08:23,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 11:08:23,036 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 11:08:23,146 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:08:23,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:08:23 BoogieIcfgContainer [2025-01-09 11:08:23,150 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:08:23,152 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:08:23,152 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:08:23,152 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:08:23,152 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:08:03" (3/4) ... [2025-01-09 11:08:23,154 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:08:23,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:08:23,155 INFO L158 Benchmark]: Toolchain (without parser) took 20622.18ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 121.7MB in the beginning and 228.5MB in the end (delta: -106.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:08:23,155 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:08:23,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.76ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 106.7MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:08:23,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.63ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 102.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:08:23,156 INFO L158 Benchmark]: Boogie Preprocessor took 62.36ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 97.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:08:23,156 INFO L158 Benchmark]: RCFGBuilder took 368.77ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 72.3MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 11:08:23,156 INFO L158 Benchmark]: TraceAbstraction took 19871.93ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 71.4MB in the beginning and 230.9MB in the end (delta: -159.5MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. [2025-01-09 11:08:23,157 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 276.8MB. Free memory was 230.9MB in the beginning and 228.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:08:23,158 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.18ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.76ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 106.7MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.63ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 102.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.36ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 97.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 368.77ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 72.3MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19871.93ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 71.4MB in the beginning and 230.9MB in the end (delta: -159.5MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 276.8MB. Free memory was 230.9MB in the beginning and 228.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] unsigned short int var_1_21 = 25; [L38] unsigned char var_1_27 = 1; [L39] unsigned char var_1_31 = 1; [L40] unsigned long int var_1_33 = 2; [L41] unsigned short int var_1_34 = 0; [L42] signed short int var_1_35 = -10; [L43] unsigned char var_1_40 = 2; [L44] unsigned short int var_1_42 = 8; [L45] unsigned long int var_1_44 = 1249494912; [L46] double last_1_var_1_1 = 5.05; [L47] unsigned short int last_1_var_1_9 = 1; [L48] unsigned long int last_1_var_1_11 = 8; [L49] unsigned char last_1_var_1_14 = 32; [L50] unsigned char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L161] isInitial = 1 [L162] FCALL initially() [L164] CALL updateLastVariables() [L150] last_1_var_1_1 = var_1_1 [L151] last_1_var_1_9 = var_1_9 [L152] last_1_var_1_11 = var_1_11 [L153] last_1_var_1_14 = var_1_14 [L154] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L164] RET updateLastVariables() [L165] CALL updateVariables() [L124] var_1_6 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L125] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L126] var_1_7 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L127] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L128] var_1_8 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L129] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L130] var_1_13 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L131] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L132] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L133] var_1_15 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L134] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L135] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L136] var_1_16 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L137] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L138] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L139] var_1_17 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L140] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L141] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L142] var_1_19 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L143] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L144] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L145] var_1_44 = __VERIFIER_nondet_ulong() [L146] CALL assume_abort_if_not(var_1_44 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L146] RET assume_abort_if_not(var_1_44 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L147] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=2, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L165] RET updateVariables() [L166] CALL step() [L54] COND TRUE \read(var_1_13) [L55] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L59] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L68] COND TRUE var_1_9 >= (~ var_1_15) [L69] var_1_40 = var_1_17 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L71] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L72] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L76] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L77] COND FALSE !(var_1_18 >= stepLocal_0) [L80] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L82] var_1_34 = (var_1_14 + 4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L83] COND TRUE \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L84] COND FALSE !(var_1_18 < 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L94] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L95] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L97] COND TRUE \read(var_1_20) [L98] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L100] COND FALSE !((var_1_9 <= var_1_17) && var_1_20) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L111] var_1_33 = var_1_14 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L112] COND TRUE ((var_1_6 - var_1_6) + var_1_8) == var_1_6 [L113] var_1_35 = var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L115] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L116] COND TRUE ((((var_1_11) < (var_1_15)) ? (var_1_11) : (var_1_15))) > var_1_14 [L117] var_1_21 = (((((((((var_1_14) < (0)) ? (var_1_14) : (0))) + var_1_17)) < (16)) ? ((((((var_1_14) < (0)) ? (var_1_14) : (0))) + var_1_17)) : (16))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=1, var_1_21=0, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L119] COND TRUE var_1_9 > (- var_1_17) [L120] var_1_31 = (var_1_13 && var_1_13) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=1, var_1_21=0, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=1, var_1_21=0, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=1, var_1_21=0, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=256, var_1_17=-256, var_1_18=-4294967307, var_1_19=-4294967298, var_1_1=2, var_1_20=1, var_1_21=0, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=-256, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 6, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1755 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1722 mSDsluCounter, 3187 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2528 mSDsCounter, 686 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3872 IncrementalHoareTripleChecker+Invalid, 4558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 686 mSolverCounterUnsat, 659 mSDtfsCounter, 3872 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 668 GetRequests, 547 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3988 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=553occurred in iteration=5, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 452 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1094 NumberOfCodeBlocks, 1094 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1083 ConstructedInterpolants, 0 QuantifiedInterpolants, 6545 SizeOfPredicates, 8 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 4037/4200 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:08:23,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.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 8f42b3e590c3342934300a63742dfb4f9c28cfc7e02ac6f0af20972824a6c5c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:08:25,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:08:25,315 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:08:25,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:08:25,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:08:25,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:08:25,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:08:25,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:08:25,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:08:25,346 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:08:25,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:08:25,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:08:25,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:08:25,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:08:25,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:08:25,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:08:25,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:08:25,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:08:25,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:08:25,349 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 -> 8f42b3e590c3342934300a63742dfb4f9c28cfc7e02ac6f0af20972824a6c5c3 [2025-01-09 11:08:25,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:08:25,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:08:25,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:08:25,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:08:25,613 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:08:25,613 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-70.i [2025-01-09 11:08:26,868 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c416f826f/4e0338051ea54a4c8bff1bd9bedb0088/FLAG1c1fb5b49 [2025-01-09 11:08:27,053 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:08:27,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i [2025-01-09 11:08:27,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c416f826f/4e0338051ea54a4c8bff1bd9bedb0088/FLAG1c1fb5b49 [2025-01-09 11:08:27,072 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c416f826f/4e0338051ea54a4c8bff1bd9bedb0088 [2025-01-09 11:08:27,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:08:27,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:08:27,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:08:27,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:08:27,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:08:27,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c83f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27, skipping insertion in model container [2025-01-09 11:08:27,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:08:27,204 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-70.i[919,932] [2025-01-09 11:08:27,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:08:27,259 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:08:27,266 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-70.i[919,932] [2025-01-09 11:08:27,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:08:27,301 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:08:27,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27 WrapperNode [2025-01-09 11:08:27,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:08:27,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:08:27,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:08:27,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:08:27,306 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:08:27" (1/1) ... [2025-01-09 11:08:27,317 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:08:27" (1/1) ... [2025-01-09 11:08:27,349 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2025-01-09 11:08:27,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:08:27,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:08:27,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:08:27,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:08:27,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,382 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:08:27,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:08:27,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:08:27,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:08:27,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:08:27,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27" (1/1) ... [2025-01-09 11:08:27,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:08:27,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:08:27,446 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:08:27,455 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:08:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:08:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:08:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:08:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:08:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:08:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:08:27,529 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:08:27,531 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:08:33,314 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 11:08:33,315 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:08:33,327 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:08:33,328 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:08:33,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:08:33 BoogieIcfgContainer [2025-01-09 11:08:33,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:08:33,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:08:33,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:08:33,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:08:33,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:08:27" (1/3) ... [2025-01-09 11:08:33,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5e9e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:08:33, skipping insertion in model container [2025-01-09 11:08:33,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:08:27" (2/3) ... [2025-01-09 11:08:33,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5e9e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:08:33, skipping insertion in model container [2025-01-09 11:08:33,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:08:33" (3/3) ... [2025-01-09 11:08:33,337 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i [2025-01-09 11:08:33,348 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:08:33,350 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:08:33,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:08:33,419 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;@17b83a32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:08:33,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:08:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 47 states have internal predecessors, (68), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 11:08:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 11:08:33,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:33,443 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:33,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:33,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:33,448 INFO L85 PathProgramCache]: Analyzing trace with hash -311625834, now seen corresponding path program 1 times [2025-01-09 11:08:33,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:08:33,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167646601] [2025-01-09 11:08:33,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:33,457 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:08:33,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:08:33,460 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:08:33,463 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:08:33,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 11:08:33,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 11:08:33,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:33,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:33,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:08:33,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:08:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 11:08:33,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:08:33,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:08:33,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167646601] [2025-01-09 11:08:33,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167646601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:33,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:08:33,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:08:33,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058262310] [2025-01-09 11:08:33,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:33,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:08:33,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:08:33,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:08:33,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:08:33,973 INFO L87 Difference]: Start difference. First operand has 64 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 47 states have internal predecessors, (68), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 11:08:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:34,000 INFO L93 Difference]: Finished difference Result 122 states and 206 transitions. [2025-01-09 11:08:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:08:34,003 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-01-09 11:08:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:34,007 INFO L225 Difference]: With dead ends: 122 [2025-01-09 11:08:34,008 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 11:08:34,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:08:34,014 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:34,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:08:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 11:08:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-09 11:08:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 11:08:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2025-01-09 11:08:34,051 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 90 transitions. Word has length 109 [2025-01-09 11:08:34,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:34,051 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 90 transitions. [2025-01-09 11:08:34,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 11:08:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 90 transitions. [2025-01-09 11:08:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 11:08:34,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:34,056 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:34,072 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 11:08:34,257 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:08:34,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:34,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1083598190, now seen corresponding path program 1 times [2025-01-09 11:08:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:08:34,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599650610] [2025-01-09 11:08:34,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:34,258 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:08:34,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:08:34,262 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:08:34,263 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:08:34,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 11:08:34,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 11:08:34,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:34,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:34,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 11:08:34,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:08:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 11:08:36,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:08:38,701 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:08:38,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599650610] [2025-01-09 11:08:38,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599650610] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:08:38,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1705649198] [2025-01-09 11:08:38,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:38,702 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:08:38,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:08:38,705 INFO L229 MonitoredProcess]: Starting monitored process 4 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:08:38,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 11:08:38,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 11:08:38,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 11:08:38,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:38,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:39,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:08:39,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:08:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 11:08:39,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:08:39,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1705649198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:39,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:08:39,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-01-09 11:08:39,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8683499] [2025-01-09 11:08:39,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:39,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:08:39,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:08:39,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:08:39,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:08:39,114 INFO L87 Difference]: Start difference. First operand 61 states and 90 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 11:08:43,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:08:44,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:08:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:44,836 INFO L93 Difference]: Finished difference Result 156 states and 228 transitions. [2025-01-09 11:08:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:08:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2025-01-09 11:08:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:44,865 INFO L225 Difference]: With dead ends: 156 [2025-01-09 11:08:44,865 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 11:08:44,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:08:44,866 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:44,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 176 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2025-01-09 11:08:44,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 11:08:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2025-01-09 11:08:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 75 states have internal predecessors, (102), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 11:08:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 138 transitions. [2025-01-09 11:08:44,885 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 138 transitions. Word has length 109 [2025-01-09 11:08:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:44,886 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 138 transitions. [2025-01-09 11:08:44,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 11:08:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 138 transitions. [2025-01-09 11:08:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 11:08:44,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:44,887 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:44,902 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:08:45,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-01-09 11:08:45,289 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 11:08:45,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:45,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1901246640, now seen corresponding path program 1 times [2025-01-09 11:08:45,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:08:45,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374363107] [2025-01-09 11:08:45,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:45,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:08:45,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:08:45,295 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:08:45,297 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:08:45,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 11:08:45,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 11:08:45,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:45,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:45,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 11:08:45,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:08:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 11:08:46,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:08:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 11:08:46,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:08:46,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374363107] [2025-01-09 11:08:46,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374363107] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:08:46,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:08:46,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 11:08:46,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991325579] [2025-01-09 11:08:46,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:08:46,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:08:46,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:08:46,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:08:46,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:08:46,389 INFO L87 Difference]: Start difference. First operand 95 states and 138 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 11:08:50,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:08:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:08:50,410 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2025-01-09 11:08:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:08:50,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 109 [2025-01-09 11:08:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:08:50,439 INFO L225 Difference]: With dead ends: 163 [2025-01-09 11:08:50,439 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 11:08:50,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:08:50,440 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 98 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:08:50,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 159 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-09 11:08:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 11:08:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-01-09 11:08:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 11:08:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2025-01-09 11:08:50,451 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 109 [2025-01-09 11:08:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:08:50,451 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2025-01-09 11:08:50,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 11:08:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2025-01-09 11:08:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 11:08:50,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:08:50,458 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:50,498 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:08:50,658 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:08:50,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:08:50,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:08:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash 563405513, now seen corresponding path program 1 times [2025-01-09 11:08:50,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:08:50,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148503607] [2025-01-09 11:08:50,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:50,661 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:08:50,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:08:50,663 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:08:50,664 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:08:50,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 11:08:50,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 11:08:50,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:50,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:50,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 11:08:51,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:08:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 11:08:52,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:08:53,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:08:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148503607] [2025-01-09 11:08:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148503607] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:08:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1445718306] [2025-01-09 11:08:53,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:08:53,201 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:08:53,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:08:53,203 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:08:53,205 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:08:53,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 11:08:53,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 11:08:53,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:08:53,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:08:54,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 11:08:54,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:08:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 11:08:55,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:08:55,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1445718306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:08:55,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:08:55,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-01-09 11:08:55,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651527367] [2025-01-09 11:08:55,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:08:55,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:08:55,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:08:55,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:08:55,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:08:55,643 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 11:09:00,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:09:04,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:09:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:09:04,901 INFO L93 Difference]: Finished difference Result 305 states and 413 transitions. [2025-01-09 11:09:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:09:04,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 110 [2025-01-09 11:09:04,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:09:04,903 INFO L225 Difference]: With dead ends: 305 [2025-01-09 11:09:04,903 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 11:09:04,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:09:04,904 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 159 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:09:04,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 320 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-01-09 11:09:04,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 11:09:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 232. [2025-01-09 11:09:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 165 states have (on average 1.2484848484848485) internal successors, (206), 166 states have internal predecessors, (206), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 11:09:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 314 transitions. [2025-01-09 11:09:04,922 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 314 transitions. Word has length 110 [2025-01-09 11:09:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:09:04,923 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 314 transitions. [2025-01-09 11:09:04,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 11:09:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 314 transitions. [2025-01-09 11:09:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 11:09:04,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:09:04,924 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:04,934 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:09:05,140 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:09:05,329 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:09:05,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:09:05,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:09:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash 561558471, now seen corresponding path program 1 times [2025-01-09 11:09:05,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:09:05,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340177128] [2025-01-09 11:09:05,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:09:05,330 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:09:05,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:09:05,332 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:09:05,334 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:09:05,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 11:09:05,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 11:09:05,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:09:05,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:09:05,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 11:09:05,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:09:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 11:09:07,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:09:07,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:09:07,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340177128] [2025-01-09 11:09:07,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340177128] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:09:07,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [194796022] [2025-01-09 11:09:07,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:09:07,674 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:09:07,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:09:07,677 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:09:07,678 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:09:07,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 11:09:08,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 11:09:08,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:09:08,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:09:08,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 11:09:08,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:09:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 11:09:09,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:09:09,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [194796022] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:09:09,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:09:09,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-01-09 11:09:09,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199094369] [2025-01-09 11:09:09,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:09:09,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:09:09,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:09:09,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:09:09,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:09:09,983 INFO L87 Difference]: Start difference. First operand 232 states and 314 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 11:09:15,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:09:19,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:09:23,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:09:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:09:24,828 INFO L93 Difference]: Finished difference Result 656 states and 879 transitions. [2025-01-09 11:09:24,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 11:09:24,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2025-01-09 11:09:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:09:24,833 INFO L225 Difference]: With dead ends: 656 [2025-01-09 11:09:24,833 INFO L226 Difference]: Without dead ends: 427 [2025-01-09 11:09:24,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2025-01-09 11:09:24,836 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 183 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:09:24,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 366 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2025-01-09 11:09:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-09 11:09:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 290. [2025-01-09 11:09:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 204 states have (on average 1.2303921568627452) internal successors, (251), 205 states have internal predecessors, (251), 69 states have call successors, (69), 16 states have call predecessors, (69), 16 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 11:09:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 389 transitions. [2025-01-09 11:09:24,867 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 389 transitions. Word has length 110 [2025-01-09 11:09:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:09:24,868 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 389 transitions. [2025-01-09 11:09:24,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 11:09:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 389 transitions. [2025-01-09 11:09:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 11:09:24,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:09:24,869 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:24,883 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:09:25,080 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:09:25,269 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:09:25,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:09:25,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:09:25,271 INFO L85 PathProgramCache]: Analyzing trace with hash -459509883, now seen corresponding path program 1 times [2025-01-09 11:09:25,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:09:25,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760411071] [2025-01-09 11:09:25,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:09:25,271 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:09:25,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:09:25,273 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:09:25,275 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:09:25,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 11:09:25,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 11:09:25,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:09:25,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:09:25,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 11:09:25,642 INFO L279 TraceCheckSpWp]: Computing forward predicates...