./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.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-ps-ci_file-61.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 7014f5cf86bf85960587729bb0a84b56b2d8b79500e75091317911ebcbd2002f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:43:29,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:43:29,245 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:43:29,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:43:29,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:43:29,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:43:29,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:43:29,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:43:29,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:43:29,279 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:43:29,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:43:29,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:43:29,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:43:29,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:43:29,280 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:43:29,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:43:29,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:43:29,281 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:43:29,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:43:29,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:43:29,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:43:29,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:43:29,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:43:29,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:43:29,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:43:29,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:43:29,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:43:29,282 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:43:29,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:43:29,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:43:29,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:43:29,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:43:29,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:43:29,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:43:29,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:43:29,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:43:29,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:43:29,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:43:29,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:43:29,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:43:29,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:43:29,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:43:29,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:43:29,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:43:29,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:43:29,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:43:29,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:43:29,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:43:29,285 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 -> 7014f5cf86bf85960587729bb0a84b56b2d8b79500e75091317911ebcbd2002f [2025-01-09 11:43:29,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:43:29,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:43:29,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:43:29,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:43:29,595 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:43:29,596 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-ps-ci_file-61.i [2025-01-09 11:43:30,918 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdb13bab4/5f915515404b432da1f252aea92514c6/FLAG8786ccffd [2025-01-09 11:43:31,229 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:43:31,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i [2025-01-09 11:43:31,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdb13bab4/5f915515404b432da1f252aea92514c6/FLAG8786ccffd [2025-01-09 11:43:31,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdb13bab4/5f915515404b432da1f252aea92514c6 [2025-01-09 11:43:31,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:43:31,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:43:31,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:43:31,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:43:31,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:43:31,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2257d5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31, skipping insertion in model container [2025-01-09 11:43:31,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:43:31,421 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-ps-ci_file-61.i[919,932] [2025-01-09 11:43:31,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:43:31,527 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:43:31,541 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-ps-ci_file-61.i[919,932] [2025-01-09 11:43:31,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:43:31,604 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:43:31,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31 WrapperNode [2025-01-09 11:43:31,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:43:31,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:43:31,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:43:31,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:43:31,614 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:43:31" (1/1) ... [2025-01-09 11:43:31,630 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:43:31" (1/1) ... [2025-01-09 11:43:31,665 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-01-09 11:43:31,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:43:31,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:43:31,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:43:31,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:43:31,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,691 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:43:31,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:43:31,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:43:31,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:43:31,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:43:31,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31" (1/1) ... [2025-01-09 11:43:31,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:43:31,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:43:31,754 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:43:31,761 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:43:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:43:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:43:31,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:43:31,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:43:31,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:43:31,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:43:31,863 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:43:31,865 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:43:32,283 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-09 11:43:32,284 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:43:32,296 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:43:32,298 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:43:32,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:43:32 BoogieIcfgContainer [2025-01-09 11:43:32,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:43:32,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:43:32,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:43:32,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:43:32,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:43:31" (1/3) ... [2025-01-09 11:43:32,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b51f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:43:32, skipping insertion in model container [2025-01-09 11:43:32,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:31" (2/3) ... [2025-01-09 11:43:32,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b51f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:43:32, skipping insertion in model container [2025-01-09 11:43:32,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:43:32" (3/3) ... [2025-01-09 11:43:32,308 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i [2025-01-09 11:43:32,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:43:32,324 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:43:32,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:43:32,377 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;@2f97af81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:43:32,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:43:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:43:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 11:43:32,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:32,393 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:32,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:32,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2032010013, now seen corresponding path program 1 times [2025-01-09 11:43:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:43:32,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852752332] [2025-01-09 11:43:32,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:43:32,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 11:43:32,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 11:43:32,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:32,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 11:43:32,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:43:32,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852752332] [2025-01-09 11:43:32,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852752332] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:43:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365187641] [2025-01-09 11:43:32,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:32,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:43:32,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:43:32,711 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:43:32,712 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:43:32,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 11:43:32,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 11:43:32,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:32,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:32,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:43:32,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:43:32,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 11:43:32,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:43:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365187641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:43:32,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:43:32,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:43:32,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881119476] [2025-01-09 11:43:32,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:43:32,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:43:32,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:43:33,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:43:33,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:43:33,005 INFO L87 Difference]: Start difference. First operand has 101 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:43:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:43:33,040 INFO L93 Difference]: Finished difference Result 196 states and 337 transitions. [2025-01-09 11:43:33,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:43:33,042 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2025-01-09 11:43:33,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:43:33,049 INFO L225 Difference]: With dead ends: 196 [2025-01-09 11:43:33,050 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 11:43:33,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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:43:33,057 INFO L435 NwaCegarLoop]: 152 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, 152 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:43:33,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:43:33,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 11:43:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 11:43:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:43:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2025-01-09 11:43:33,111 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 165 [2025-01-09 11:43:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:43:33,113 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2025-01-09 11:43:33,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:43:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2025-01-09 11:43:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 11:43:33,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:33,118 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:33,128 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:43:33,323 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:43:33,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:33,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:33,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1365693145, now seen corresponding path program 1 times [2025-01-09 11:43:33,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:43:33,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002432014] [2025-01-09 11:43:33,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:33,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:43:33,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 11:43:33,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 11:43:33,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:33,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:43:33,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:43:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002432014] [2025-01-09 11:43:33,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002432014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:43:33,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:43:33,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:43:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573013330] [2025-01-09 11:43:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:43:33,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:43:33,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:43:33,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:43:33,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:43:33,634 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:43:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:43:33,669 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2025-01-09 11:43:33,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:43:33,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-01-09 11:43:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:43:33,672 INFO L225 Difference]: With dead ends: 193 [2025-01-09 11:43:33,672 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 11:43:33,673 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:43:33,677 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:43:33,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:43:33,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 11:43:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 11:43:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:43:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2025-01-09 11:43:33,696 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 165 [2025-01-09 11:43:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:43:33,697 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2025-01-09 11:43:33,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:43:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2025-01-09 11:43:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 11:43:33,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:33,701 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:33,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:43:33,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:33,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash -323250597, now seen corresponding path program 1 times [2025-01-09 11:43:33,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:43:33,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164474535] [2025-01-09 11:43:33,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:33,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:43:33,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 11:43:33,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 11:43:33,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:33,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:43:33,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:43:33,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164474535] [2025-01-09 11:43:33,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164474535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:43:33,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:43:33,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:43:33,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137539510] [2025-01-09 11:43:33,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:43:33,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:43:33,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:43:33,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:43:33,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:43:33,999 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:43:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:43:34,181 INFO L93 Difference]: Finished difference Result 288 states and 447 transitions. [2025-01-09 11:43:34,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:43:34,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2025-01-09 11:43:34,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:43:34,185 INFO L225 Difference]: With dead ends: 288 [2025-01-09 11:43:34,186 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 11:43:34,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:43:34,187 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 197 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:43:34,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 300 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:43:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 11:43:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-01-09 11:43:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 140 states have (on average 1.4357142857142857) internal successors, (201), 140 states have internal predecessors, (201), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 11:43:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 297 transitions. [2025-01-09 11:43:34,232 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 297 transitions. Word has length 165 [2025-01-09 11:43:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:43:34,232 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 297 transitions. [2025-01-09 11:43:34,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:43:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 297 transitions. [2025-01-09 11:43:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 11:43:34,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:34,239 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:34,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:43:34,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:34,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:34,240 INFO L85 PathProgramCache]: Analyzing trace with hash -104395879, now seen corresponding path program 1 times [2025-01-09 11:43:34,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:43:34,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109276463] [2025-01-09 11:43:34,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:34,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:43:34,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 11:43:34,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 11:43:34,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:34,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:43:34,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:43:34,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109276463] [2025-01-09 11:43:34,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109276463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:43:34,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:43:34,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:43:34,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900196133] [2025-01-09 11:43:34,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:43:34,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:43:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:43:34,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:43:34,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:43:34,653 INFO L87 Difference]: Start difference. First operand 191 states and 297 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:43:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:43:34,790 INFO L93 Difference]: Finished difference Result 193 states and 298 transitions. [2025-01-09 11:43:34,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:43:34,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-01-09 11:43:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:43:34,792 INFO L225 Difference]: With dead ends: 193 [2025-01-09 11:43:34,792 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 11:43:34,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:43:34,794 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 95 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:43:34,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 233 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:43:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 11:43:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 11:43:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 72 states have internal predecessors, (101), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:43:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2025-01-09 11:43:34,808 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 165 [2025-01-09 11:43:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:43:34,810 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2025-01-09 11:43:34,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:43:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2025-01-09 11:43:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 11:43:34,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:34,812 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:34,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:43:34,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:34,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1384259557, now seen corresponding path program 1 times [2025-01-09 11:43:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:43:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044626331] [2025-01-09 11:43:34,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:43:34,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 11:43:34,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 11:43:34,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:34,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:43:35,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:43:35,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044626331] [2025-01-09 11:43:35,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044626331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:43:35,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:43:35,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:43:35,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480473295] [2025-01-09 11:43:35,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:43:35,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:43:35,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:43:35,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:43:35,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:43:35,210 INFO L87 Difference]: Start difference. First operand 98 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:43:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:43:35,429 INFO L93 Difference]: Finished difference Result 287 states and 439 transitions. [2025-01-09 11:43:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:43:35,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-01-09 11:43:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:43:35,432 INFO L225 Difference]: With dead ends: 287 [2025-01-09 11:43:35,432 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 11:43:35,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:43:35,433 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 236 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:43:35,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 333 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:43:35,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 11:43:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 122. [2025-01-09 11:43:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:43:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 184 transitions. [2025-01-09 11:43:35,467 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 184 transitions. Word has length 165 [2025-01-09 11:43:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:43:35,468 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 184 transitions. [2025-01-09 11:43:35,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:43:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 184 transitions. [2025-01-09 11:43:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 11:43:35,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:35,470 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:35,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:43:35,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:35,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:35,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1322359837, now seen corresponding path program 1 times [2025-01-09 11:43:35,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:43:35,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047851666] [2025-01-09 11:43:35,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:35,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:43:35,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 11:43:35,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 11:43:35,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:35,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:43:35,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:43:35,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047851666] [2025-01-09 11:43:35,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047851666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:43:35,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:43:35,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:43:35,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852421960] [2025-01-09 11:43:35,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:43:35,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:43:35,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:43:35,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:43:35,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:43:35,686 INFO L87 Difference]: Start difference. First operand 122 states and 184 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:43:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:43:35,869 INFO L93 Difference]: Finished difference Result 311 states and 470 transitions. [2025-01-09 11:43:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:43:35,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-01-09 11:43:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:43:35,871 INFO L225 Difference]: With dead ends: 311 [2025-01-09 11:43:35,871 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 11:43:35,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:43:35,872 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 134 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:43:35,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 384 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:43:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 11:43:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 122. [2025-01-09 11:43:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:43:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 183 transitions. [2025-01-09 11:43:35,913 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 183 transitions. Word has length 165 [2025-01-09 11:43:35,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:43:35,913 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 183 transitions. [2025-01-09 11:43:35,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:43:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 183 transitions. [2025-01-09 11:43:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 11:43:35,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:35,916 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:35,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:43:35,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:35,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash -810331811, now seen corresponding path program 1 times [2025-01-09 11:43:35,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:43:35,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220128253] [2025-01-09 11:43:35,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:35,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:43:35,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 11:43:36,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 11:43:36,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:36,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:43:36,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754880] [2025-01-09 11:43:36,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:36,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:43:36,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:43:36,080 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:43:36,083 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:43:36,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 11:43:36,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 11:43:36,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:36,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:36,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 11:43:36,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:43:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-01-09 11:43:36,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:43:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 11:43:37,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:43:37,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220128253] [2025-01-09 11:43:37,486 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 11:43:37,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754880] [2025-01-09 11:43:37,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754880] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:43:37,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:43:37,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-01-09 11:43:37,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498531408] [2025-01-09 11:43:37,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:43:37,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:43:37,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:43:37,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:43:37,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:43:37,488 INFO L87 Difference]: Start difference. First operand 122 states and 183 transitions. Second operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-01-09 11:43:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:43:39,475 INFO L93 Difference]: Finished difference Result 580 states and 844 transitions. [2025-01-09 11:43:39,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 11:43:39,476 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 167 [2025-01-09 11:43:39,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:43:39,479 INFO L225 Difference]: With dead ends: 580 [2025-01-09 11:43:39,479 INFO L226 Difference]: Without dead ends: 461 [2025-01-09 11:43:39,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=1509, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 11:43:39,482 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 781 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:43:39,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 928 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 11:43:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-01-09 11:43:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 320. [2025-01-09 11:43:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 263 states have (on average 1.349809885931559) internal successors, (355), 265 states have internal predecessors, (355), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 11:43:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2025-01-09 11:43:39,552 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 167 [2025-01-09 11:43:39,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:43:39,553 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2025-01-09 11:43:39,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-01-09 11:43:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2025-01-09 11:43:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 11:43:39,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:39,558 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:39,567 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:43:39,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:43:39,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:39,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:39,760 INFO L85 PathProgramCache]: Analyzing trace with hash -372143472, now seen corresponding path program 1 times [2025-01-09 11:43:39,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:43:39,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783261577] [2025-01-09 11:43:39,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:39,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:43:39,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 11:43:39,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 11:43:39,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:39,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:43:39,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426496003] [2025-01-09 11:43:39,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:39,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:43:39,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:43:39,881 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:43:39,888 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:43:39,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 11:43:40,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 11:43:40,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:40,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:40,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 11:43:40,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:43:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 465 proven. 18 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2025-01-09 11:43:41,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:43:43,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:43:43,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783261577] [2025-01-09 11:43:43,108 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 11:43:43,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426496003] [2025-01-09 11:43:43,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426496003] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:43:43,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:43:43,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-01-09 11:43:43,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18073793] [2025-01-09 11:43:43,108 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 11:43:43,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:43:43,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:43:43,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:43:43,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:43:43,109 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:43:44,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:43:44,241 INFO L93 Difference]: Finished difference Result 666 states and 925 transitions. [2025-01-09 11:43:44,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:43:44,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 168 [2025-01-09 11:43:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:43:44,245 INFO L225 Difference]: With dead ends: 666 [2025-01-09 11:43:44,246 INFO L226 Difference]: Without dead ends: 349 [2025-01-09 11:43:44,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2025-01-09 11:43:44,248 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 202 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:43:44,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 420 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:43:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-01-09 11:43:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 307. [2025-01-09 11:43:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 257 states have (on average 1.3035019455252919) internal successors, (335), 259 states have internal predecessors, (335), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 11:43:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 417 transitions. [2025-01-09 11:43:44,286 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 417 transitions. Word has length 168 [2025-01-09 11:43:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:43:44,286 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 417 transitions. [2025-01-09 11:43:44,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:43:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 417 transitions. [2025-01-09 11:43:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 11:43:44,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:44,289 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:44,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 11:43:44,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:43:44,489 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:44,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1520268912, now seen corresponding path program 1 times [2025-01-09 11:43:44,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:43:44,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519431944] [2025-01-09 11:43:44,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:44,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:43:44,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 11:43:44,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 11:43:44,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:44,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:43:44,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481909278] [2025-01-09 11:43:44,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:44,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:43:44,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:43:44,566 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:43:44,568 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:43:44,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 11:43:44,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 11:43:44,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:44,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:43:44,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:43:44,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 11:43:44,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 11:43:44,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:44,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:43:45,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:43:45,007 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:43:45,008 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:43:45,019 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:43:45,210 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,SelfDestructingSolverStorable8 [2025-01-09 11:43:45,213 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:43:45,345 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:43:45,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:43:45 BoogieIcfgContainer [2025-01-09 11:43:45,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:43:45,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:43:45,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:43:45,353 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:43:45,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:43:32" (3/4) ... [2025-01-09 11:43:45,356 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:43:45,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:43:45,358 INFO L158 Benchmark]: Toolchain (without parser) took 14095.33ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 122.7MB in the beginning and 75.3MB in the end (delta: 47.4MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. [2025-01-09 11:43:45,358 INFO L158 Benchmark]: CDTParser took 1.21ms. Allocated memory is still 192.9MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:43:45,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.17ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 107.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:43:45,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.64ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 104.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:43:45,359 INFO L158 Benchmark]: Boogie Preprocessor took 48.22ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 101.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:43:45,359 INFO L158 Benchmark]: RCFGBuilder took 583.71ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 75.5MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 11:43:45,360 INFO L158 Benchmark]: TraceAbstraction took 13051.47ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 75.1MB in the beginning and 75.3MB in the end (delta: -253.6kB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. [2025-01-09 11:43:45,360 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 251.7MB. Free memory was 75.3MB in the beginning and 75.3MB in the end (delta: 51.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:43:45,361 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.21ms. Allocated memory is still 192.9MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.17ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 107.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.64ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 104.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.22ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 101.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 583.71ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 75.5MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13051.47ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 75.1MB in the beginning and 75.3MB in the end (delta: -253.6kB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 251.7MB. Free memory was 75.3MB in the beginning and 75.3MB in the end (delta: 51.1kB). 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 someBinaryArithmeticDOUBLEoperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someUnaryFLOAToperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] unsigned long int var_1_24 = 2; [L41] unsigned long int var_1_26 = 1; [L42] double var_1_33 = 1.5; [L43] double var_1_35 = 50.5; [L44] double var_1_36 = 1.9; [L45] unsigned long int var_1_37 = 10000; [L46] unsigned char var_1_38 = 1; [L47] unsigned char var_1_39 = 0; [L48] double var_1_40 = 15.5; [L49] unsigned long int var_1_42 = 128; [L50] signed char var_1_43 = -1; [L51] signed long int last_1_var_1_9 = -50; VAL [isInitial=0, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L189] isInitial = 1 [L190] FCALL initially() [L192] CALL updateLastVariables() [L182] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_ulong() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L146] var_1_6 = __VERIFIER_nondet_ulong() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L149] var_1_8 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L150] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L151] var_1_14 = __VERIFIER_nondet_ulong() [L152] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L152] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L153] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L153] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L154] var_1_15 = __VERIFIER_nondet_ulong() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L156] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L156] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L157] var_1_16 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L158] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L159] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L159] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L160] var_1_17 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L161] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L162] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L162] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L163] var_1_18 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L164] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L165] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L165] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L166] var_1_20 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L168] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L168] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L169] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L169] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L170] var_1_23 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L171] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L172] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L172] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L173] var_1_35 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L174] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L175] var_1_36 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L176] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L177] var_1_39 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L178] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L179] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L179] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L193] RET updateVariables() [L194] CALL step() [L55] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=-4294967296, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L56] COND FALSE !(var_1_5 != var_1_21) [L63] var_1_26 = 16u VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L65] COND TRUE \read(var_1_17) [L66] var_1_33 = (var_1_35 - var_1_36) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L68] COND FALSE !(var_1_35 >= var_1_8) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L73] COND TRUE var_1_16 < ((var_1_6 + 16u) * var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L74] COND FALSE !(var_1_17 && (var_1_35 < var_1_36)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_9=-50] [L82] COND TRUE (var_1_35 <= 64.5) && var_1_18 [L83] var_1_40 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L87] COND FALSE !(var_1_20 < var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L90] COND TRUE \read(var_1_17) [L91] var_1_43 = ((((((((-16) < 0 ) ? -(-16) : (-16)))) > (var_1_23)) ? (((((-16) < 0 ) ? -(-16) : (-16)))) : (var_1_23))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L93] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_0=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L94] COND FALSE !(stepLocal_0 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L97] var_1_21 = var_1_6 [L98] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L99] COND FALSE !((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L102] unsigned long int stepLocal_4 = 4256310412u - 128u; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_4=4256310284, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L103] COND FALSE !(var_1_4 >= stepLocal_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L106] signed long int stepLocal_3 = var_1_9; [L107] unsigned long int stepLocal_2 = (((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=50, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L108] EXPR var_1_21 ^ 4u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=50, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=79/5, var_1_8=3, var_1_9=-50] [L108] unsigned long int stepLocal_1 = var_1_21 ^ 4u; [L109] COND FALSE !(var_1_9 <= stepLocal_2) [L118] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=3, var_1_8=3, var_1_9=-50] [L120] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L127] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=3, var_1_8=3, var_1_9=-50] [L129] signed long int stepLocal_5 = (var_1_22 / 2) / var_1_20; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, stepLocal_5=1, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=3, var_1_8=3, var_1_9=-50] [L130] COND TRUE stepLocal_5 >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=3, var_1_8=3, var_1_9=-50] [L131] COND TRUE \read(var_1_13) [L132] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=3, var_1_8=3, var_1_9=-50] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=3, var_1_8=3, var_1_9=-50] [L185] EXPR (var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=3, var_1_8=3, var_1_9=-50] [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=3, var_1_8=3, var_1_9=-50] [L185-L186] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=3, var_1_8=3, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-2147483649, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=7, var_1_21=-4294967296, var_1_22=17, var_1_23=17, var_1_24=-4294967296, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=50, var_1_6=-4294967296, var_1_7=3, var_1_8=3, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1654 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1645 mSDsluCounter, 3045 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1745 mSDsCounter, 321 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1415 IncrementalHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 321 mSolverCounterUnsat, 1300 mSDtfsCounter, 1415 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 769 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=7, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 325 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2161 NumberOfCodeBlocks, 2161 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1647 ConstructedInterpolants, 1 QuantifiedInterpolants, 4576 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1165 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 10898/11040 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:43:45,406 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-ps-ci_file-61.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 7014f5cf86bf85960587729bb0a84b56b2d8b79500e75091317911ebcbd2002f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:43:47,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:43:47,854 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:43:47,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:43:47,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:43:47,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:43:47,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:43:47,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:43:47,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:43:47,904 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:43:47,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:43:47,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:43:47,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:43:47,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:43:47,906 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:43:47,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:43:47,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:43:47,906 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:43:47,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:43:47,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:43:47,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:43:47,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:43:47,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:43:47,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:43:47,907 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:43:47,907 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:43:47,907 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:43:47,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:43:47,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:43:47,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:43:47,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:43:47,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:43:47,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:43:47,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:43:47,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:43:47,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:43:47,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:43:47,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:43:47,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:43:47,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:43:47,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:43:47,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:43:47,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:43:47,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:43:47,910 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:43:47,911 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:43:47,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:43:47,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:43:47,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:43:47,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:43:47,911 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 -> 7014f5cf86bf85960587729bb0a84b56b2d8b79500e75091317911ebcbd2002f [2025-01-09 11:43:48,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:43:48,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:43:48,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:43:48,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:43:48,241 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:43:48,242 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-ps-ci_file-61.i [2025-01-09 11:43:49,590 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d32a74bf/e0f848bba01d4fde81f4d3366c11a7d8/FLAG4375dac4d [2025-01-09 11:43:49,884 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:43:49,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i [2025-01-09 11:43:49,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d32a74bf/e0f848bba01d4fde81f4d3366c11a7d8/FLAG4375dac4d [2025-01-09 11:43:49,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d32a74bf/e0f848bba01d4fde81f4d3366c11a7d8 [2025-01-09 11:43:49,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:43:49,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:43:49,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:43:49,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:43:49,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:43:49,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:43:49" (1/1) ... [2025-01-09 11:43:49,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7742fffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:49, skipping insertion in model container [2025-01-09 11:43:49,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:43:49" (1/1) ... [2025-01-09 11:43:49,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:43:50,074 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-ps-ci_file-61.i[919,932] [2025-01-09 11:43:50,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:43:50,157 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:43:50,165 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-ps-ci_file-61.i[919,932] [2025-01-09 11:43:50,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:43:50,214 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:43:50,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50 WrapperNode [2025-01-09 11:43:50,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:43:50,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:43:50,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:43:50,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:43:50,223 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:43:50" (1/1) ... [2025-01-09 11:43:50,236 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:43:50" (1/1) ... [2025-01-09 11:43:50,263 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-01-09 11:43:50,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:43:50,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:43:50,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:43:50,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:43:50,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50" (1/1) ... [2025-01-09 11:43:50,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50" (1/1) ... [2025-01-09 11:43:50,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50" (1/1) ... [2025-01-09 11:43:50,294 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:43:50,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50" (1/1) ... [2025-01-09 11:43:50,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50" (1/1) ... [2025-01-09 11:43:50,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50" (1/1) ... [2025-01-09 11:43:50,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50" (1/1) ... [2025-01-09 11:43:50,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50" (1/1) ... [2025-01-09 11:43:50,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50" (1/1) ... [2025-01-09 11:43:50,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50" (1/1) ... [2025-01-09 11:43:50,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:43:50,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:43:50,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:43:50,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:43:50,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50" (1/1) ... [2025-01-09 11:43:50,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:43:50,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:43:50,349 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:43:50,356 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:43:50,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:43:50,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:43:50,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:43:50,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:43:50,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:43:50,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:43:50,475 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:43:50,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:43:51,370 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 11:43:51,371 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:43:51,380 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:43:51,381 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:43:51,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:43:51 BoogieIcfgContainer [2025-01-09 11:43:51,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:43:51,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:43:51,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:43:51,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:43:51,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:43:49" (1/3) ... [2025-01-09 11:43:51,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f6e771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:43:51, skipping insertion in model container [2025-01-09 11:43:51,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:43:50" (2/3) ... [2025-01-09 11:43:51,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f6e771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:43:51, skipping insertion in model container [2025-01-09 11:43:51,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:43:51" (3/3) ... [2025-01-09 11:43:51,391 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i [2025-01-09 11:43:51,403 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:43:51,405 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-61.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:43:51,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:43:51,479 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;@2d84e4f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:43:51,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:43:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:43:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 11:43:51,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:51,497 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:51,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:51,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2078101738, now seen corresponding path program 1 times [2025-01-09 11:43:51,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:43:51,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778017782] [2025-01-09 11:43:51,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:51,518 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:43:51,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:43:51,522 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:43:51,524 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:43:51,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 11:43:51,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 11:43:51,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:51,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:51,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:43:51,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:43:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2025-01-09 11:43:51,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:43:51,917 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:43:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778017782] [2025-01-09 11:43:51,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778017782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:43:51,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:43:51,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:43:51,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051631980] [2025-01-09 11:43:51,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:43:51,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:43:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:43:51,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:43:51,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:43:51,946 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:43:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:43:51,973 INFO L93 Difference]: Finished difference Result 160 states and 281 transitions. [2025-01-09 11:43:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:43:51,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2025-01-09 11:43:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:43:51,981 INFO L225 Difference]: With dead ends: 160 [2025-01-09 11:43:51,981 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 11:43:51,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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:43:51,988 INFO L435 NwaCegarLoop]: 126 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, 126 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:43:51,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:43:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 11:43:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 11:43:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:43:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2025-01-09 11:43:52,032 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 161 [2025-01-09 11:43:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:43:52,032 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2025-01-09 11:43:52,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 11:43:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2025-01-09 11:43:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 11:43:52,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:52,035 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:52,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 11:43:52,236 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:43:52,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:52,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1583653210, now seen corresponding path program 1 times [2025-01-09 11:43:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:43:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847225543] [2025-01-09 11:43:52,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:52,239 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:43:52,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:43:52,243 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:43:52,245 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:43:52,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 11:43:52,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 11:43:52,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:52,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:52,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 11:43:52,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:43:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 573 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-01-09 11:43:52,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:43:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 33 proven. 36 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 11:43:53,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:43:53,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847225543] [2025-01-09 11:43:53,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847225543] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:43:53,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 11:43:53,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 11:43:53,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909903002] [2025-01-09 11:43:53,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 11:43:53,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:43:53,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:43:53,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:43:53,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:43:53,100 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-01-09 11:43:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:43:53,809 INFO L93 Difference]: Finished difference Result 163 states and 254 transitions. [2025-01-09 11:43:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:43:53,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 161 [2025-01-09 11:43:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:43:53,819 INFO L225 Difference]: With dead ends: 163 [2025-01-09 11:43:53,819 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 11:43:53,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:43:53,821 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 134 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:43:53,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 208 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:43:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 11:43:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-01-09 11:43:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:43:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2025-01-09 11:43:53,844 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 161 [2025-01-09 11:43:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:43:53,845 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2025-01-09 11:43:53,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-01-09 11:43:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2025-01-09 11:43:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 11:43:53,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:53,850 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:53,859 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:43:54,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:43:54,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:54,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:54,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1802507928, now seen corresponding path program 1 times [2025-01-09 11:43:54,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:43:54,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368910502] [2025-01-09 11:43:54,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:54,052 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:43:54,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:43:54,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 11:43:54,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 11:43:54,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 11:43:54,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 11:43:54,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:54,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:54,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 11:43:54,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:43:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:43:54,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:43:54,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:43:54,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368910502] [2025-01-09 11:43:54,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368910502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:43:54,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:43:54,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:43:54,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841120011] [2025-01-09 11:43:54,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:43:54,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:43:54,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:43:54,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:43:54,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:43:54,808 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:43:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:43:55,424 INFO L93 Difference]: Finished difference Result 263 states and 393 transitions. [2025-01-09 11:43:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:43:55,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-01-09 11:43:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:43:55,434 INFO L225 Difference]: With dead ends: 263 [2025-01-09 11:43:55,434 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 11:43:55,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:43:55,436 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 113 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:43:55,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 422 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:43:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 11:43:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2025-01-09 11:43:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 110 states have internal predecessors, (148), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 11:43:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2025-01-09 11:43:55,468 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 161 [2025-01-09 11:43:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:43:55,468 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2025-01-09 11:43:55,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:43:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2025-01-09 11:43:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 11:43:55,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:55,471 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:55,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 11:43:55,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 11:43:55,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:55,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:55,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1212595690, now seen corresponding path program 1 times [2025-01-09 11:43:55,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:43:55,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615261740] [2025-01-09 11:43:55,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:55,673 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:43:55,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:43:55,678 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:43:55,679 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:43:55,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 11:43:55,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 11:43:55,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:55,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:55,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 11:43:55,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:43:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 11:43:56,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:43:56,269 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:43:56,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615261740] [2025-01-09 11:43:56,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615261740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:43:56,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:43:56,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:43:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938895540] [2025-01-09 11:43:56,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:43:56,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:43:56,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:43:56,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:43:56,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:43:56,274 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:43:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:43:56,730 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2025-01-09 11:43:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:43:56,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-01-09 11:43:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:43:56,744 INFO L225 Difference]: With dead ends: 165 [2025-01-09 11:43:56,744 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 11:43:56,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:43:56,745 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:43:56,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 175 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:43:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 11:43:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 11:43:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 11:43:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2025-01-09 11:43:56,778 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 161 [2025-01-09 11:43:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:43:56,779 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2025-01-09 11:43:56,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 11:43:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2025-01-09 11:43:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 11:43:56,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:43:56,782 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:56,796 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:43:56,983 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:43:56,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:43:56,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:43:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1913660268, now seen corresponding path program 1 times [2025-01-09 11:43:56,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:43:56,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978719835] [2025-01-09 11:43:56,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:56,988 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:43:56,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:43:56,991 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:43:56,993 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:43:57,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 11:43:57,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 11:43:57,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:43:57,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:43:57,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 11:43:57,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:43:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-01-09 11:43:58,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:43:59,461 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:43:59,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978719835] [2025-01-09 11:43:59,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978719835] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:43:59,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [671968270] [2025-01-09 11:43:59,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:43:59,462 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 11:43:59,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 11:43:59,464 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:43:59,465 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:43:59,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 11:44:00,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 11:44:00,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:44:00,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:44:00,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 11:44:00,397 INFO L279 TraceCheckSpWp]: Computing forward predicates...