./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4502a09464b29bf00952bf3323a73b5690388bf06e82f0cd90fbd1bfdf0148c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:47:11,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:47:11,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:47:11,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:47:11,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:47:11,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:47:11,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:47:11,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:47:11,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:47:11,896 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:47:11,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:47:11,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:47:11,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:47:11,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:47:11,897 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:47:11,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:47:11,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:47:11,897 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:47:11,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:47:11,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:47:11,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:47:11,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:47:11,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:47:11,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:47:11,897 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:47:11,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:47:11,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:47:11,898 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:47:11,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:47:11,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:47:11,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:47:11,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:47:11,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:47:11,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:47:11,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:47:11,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:47:11,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:47:11,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:47:11,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:47:11,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:47:11,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:47:11,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:47:11,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:47:11,899 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/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 -> d4502a09464b29bf00952bf3323a73b5690388bf06e82f0cd90fbd1bfdf0148c [2025-03-08 12:47:12,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:47:12,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:47:12,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:47:12,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:47:12,144 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:47:12,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i [2025-03-08 12:47:13,301 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54278093/9568e9a834e64fa0853c67c8c4554769/FLAG8a9ee4923 [2025-03-08 12:47:13,581 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:47:13,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i [2025-03-08 12:47:13,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54278093/9568e9a834e64fa0853c67c8c4554769/FLAG8a9ee4923 [2025-03-08 12:47:13,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54278093/9568e9a834e64fa0853c67c8c4554769 [2025-03-08 12:47:13,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:47:13,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:47:13,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:47:13,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:47:13,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:47:13,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13, skipping insertion in model container [2025-03-08 12:47:13,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:47:13,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i[918,931] [2025-03-08 12:47:13,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:47:13,811 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:47:13,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i[918,931] [2025-03-08 12:47:13,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:47:13,860 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:47:13,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13 WrapperNode [2025-03-08 12:47:13,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:47:13,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:47:13,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:47:13,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:47:13,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,891 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-03-08 12:47:13,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:47:13,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:47:13,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:47:13,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:47:13,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,916 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-03-08 12:47:13,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,922 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:47:13,938 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:47:13,938 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:47:13,938 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:47:13,938 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (1/1) ... [2025-03-08 12:47:13,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:47:13,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:47:13,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:47:13,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:47:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:47:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:47:13,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:47:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:47:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:47:13,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:47:14,064 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:47:14,065 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:47:14,350 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 12:47:14,350 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:47:14,372 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:47:14,373 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:47:14,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:47:14 BoogieIcfgContainer [2025-03-08 12:47:14,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:47:14,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:47:14,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:47:14,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:47:14,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:47:13" (1/3) ... [2025-03-08 12:47:14,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f114d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:47:14, skipping insertion in model container [2025-03-08 12:47:14,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:13" (2/3) ... [2025-03-08 12:47:14,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f114d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:47:14, skipping insertion in model container [2025-03-08 12:47:14,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:47:14" (3/3) ... [2025-03-08 12:47:14,381 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i [2025-03-08 12:47:14,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:47:14,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:47:14,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:47:14,469 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;@151d377a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:47:14,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:47:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 57 states have internal predecessors, (85), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 12:47:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 12:47:14,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:47:14,483 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:47:14,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:47:14,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:47:14,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1264365825, now seen corresponding path program 1 times [2025-03-08 12:47:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:47:14,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763735883] [2025-03-08 12:47:14,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:47:14,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:47:14,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:47:14,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:47:14,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:47:14,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:47:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 12:47:14,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:47:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763735883] [2025-03-08 12:47:14,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763735883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:47:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266523833] [2025-03-08 12:47:14,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:47:14,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:47:14,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:47:14,774 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:47:14,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:47:14,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:47:14,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:47:14,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:47:14,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:47:14,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:47:14,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:47:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 12:47:14,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:47:14,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266523833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:47:14,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:47:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:47:14,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108327596] [2025-03-08 12:47:14,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:47:14,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:47:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:47:14,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:47:14,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:47:14,972 INFO L87 Difference]: Start difference. First operand has 78 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 57 states have internal predecessors, (85), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 12:47:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:47:14,994 INFO L93 Difference]: Finished difference Result 150 states and 260 transitions. [2025-03-08 12:47:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:47:14,998 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 132 [2025-03-08 12:47:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:47:15,004 INFO L225 Difference]: With dead ends: 150 [2025-03-08 12:47:15,005 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 12:47:15,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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-03-08 12:47:15,012 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:47:15,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:47:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 12:47:15,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-08 12:47:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 12:47:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2025-03-08 12:47:15,061 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 132 [2025-03-08 12:47:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:47:15,061 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2025-03-08 12:47:15,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 12:47:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2025-03-08 12:47:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 12:47:15,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:47:15,064 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:47:15,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 12:47:15,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 12:47:15,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:47:15,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:47:15,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1529219708, now seen corresponding path program 1 times [2025-03-08 12:47:15,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:47:15,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135572453] [2025-03-08 12:47:15,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:47:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:47:15,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:47:15,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:47:15,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:47:15,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:47:15,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [64893305] [2025-03-08 12:47:15,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:47:15,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:47:15,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:47:15,452 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:47:15,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:47:15,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 12:47:15,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 12:47:15,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:47:15,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:47:15,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 12:47:15,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:47:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-08 12:47:15,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:47:15,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:47:15,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135572453] [2025-03-08 12:47:15,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 12:47:15,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64893305] [2025-03-08 12:47:15,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64893305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:47:15,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:47:15,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:47:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695178003] [2025-03-08 12:47:15,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:47:15,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:47:15,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:47:15,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:47:15,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:47:15,977 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 12:47:16,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:47:16,168 INFO L93 Difference]: Finished difference Result 189 states and 289 transitions. [2025-03-08 12:47:16,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:47:16,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 133 [2025-03-08 12:47:16,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:47:16,170 INFO L225 Difference]: With dead ends: 189 [2025-03-08 12:47:16,172 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 12:47:16,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:47:16,173 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 137 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:47:16,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 216 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:47:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 12:47:16,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2025-03-08 12:47:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 12:47:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 173 transitions. [2025-03-08 12:47:16,201 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 173 transitions. Word has length 133 [2025-03-08 12:47:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:47:16,203 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 173 transitions. [2025-03-08 12:47:16,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 12:47:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 173 transitions. [2025-03-08 12:47:16,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 12:47:16,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:47:16,206 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:47:16,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:47:16,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 12:47:16,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:47:16,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:47:16,408 INFO L85 PathProgramCache]: Analyzing trace with hash 511419774, now seen corresponding path program 1 times [2025-03-08 12:47:16,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:47:16,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331682321] [2025-03-08 12:47:16,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:47:16,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:47:16,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 12:47:16,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 12:47:16,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:47:16,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:47:16,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201780175] [2025-03-08 12:47:16,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:47:16,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:47:16,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:47:16,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:47:16,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 12:47:16,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 12:47:16,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 12:47:16,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:47:16,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:47:16,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:47:16,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 12:47:16,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 12:47:16,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:47:16,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:47:16,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:47:16,947 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:47:16,948 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:47:16,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 12:47:17,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:47:17,158 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 12:47:17,221 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:47:17,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:47:17 BoogieIcfgContainer [2025-03-08 12:47:17,225 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:47:17,226 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:47:17,226 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:47:17,226 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:47:17,227 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:47:14" (3/4) ... [2025-03-08 12:47:17,229 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:47:17,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:47:17,230 INFO L158 Benchmark]: Toolchain (without parser) took 3625.97ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 105.2MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 12:47:17,230 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:47:17,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.14ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 115.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:47:17,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.83ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 112.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:47:17,230 INFO L158 Benchmark]: Boogie Preprocessor took 45.51ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 108.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:47:17,230 INFO L158 Benchmark]: IcfgBuilder took 436.14ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 85.6MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 12:47:17,230 INFO L158 Benchmark]: TraceAbstraction took 2849.95ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 105.2MB in the end (delta: -20.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:47:17,231 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 105.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:47:17,234 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.02ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.14ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 115.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.83ms. Allocated memory is still 167.8MB. Free memory was 114.8MB in the beginning and 112.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.51ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 108.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 436.14ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 85.6MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2849.95ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 105.2MB in the end (delta: -20.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 105.2MB in the end (delta: 41.6kB). 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 129, overapproximation of someBinaryArithmeticDOUBLEoperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someUnaryDOUBLEoperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 90, overapproximation of someBinaryArithmeticFLOAToperation at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.95; [L23] float var_1_4 = 9999999.8; [L24] float var_1_5 = 8.6; [L25] unsigned long int var_1_6 = 10000; [L26] double var_1_8 = 64.5; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 7.5; [L29] float var_1_12 = 0.0; [L30] float var_1_13 = 64.8; [L31] double var_1_14 = 127.75; [L32] signed char var_1_15 = 8; [L33] signed char var_1_16 = 32; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 0; [L36] double var_1_19 = 2.25; [L37] unsigned char var_1_20 = 0; [L38] unsigned short int var_1_21 = 256; [L39] float var_1_22 = 256.5; [L40] signed char var_1_27 = -64; [L41] signed char var_1_30 = -10; [L42] unsigned long int var_1_31 = 8; [L43] double var_1_32 = 499.75; [L44] double var_1_36 = 3.15; [L45] unsigned char var_1_38 = 8; [L46] float var_1_40 = 255.8; [L47] signed short int var_1_41 = 256; [L48] signed char var_1_42 = -32; [L49] unsigned long int last_1_var_1_6 = 10000; VAL [isInitial=0, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L166] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_4=49999999/5, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L176] RET updateLastVariables() [L177] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L134] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L135] var_1_5 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L136] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L137] var_1_8 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L138] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L139] var_1_11 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L140] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L141] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L141] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L142] var_1_12 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L143] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L144] var_1_13 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L145] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L146] var_1_15 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L147] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L148] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L148] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L149] var_1_16 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L150] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L151] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L151] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L152] var_1_18 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L153] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L154] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L154] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L155] var_1_30 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L156] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L157] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L157] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L158] var_1_36 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L159] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L160] var_1_42 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_42 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L161] RET assume_abort_if_not(var_1_42 >= -128) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L162] CALL assume_abort_if_not(var_1_42 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L162] RET assume_abort_if_not(var_1_42 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L163] CALL assume_abort_if_not(var_1_42 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L163] RET assume_abort_if_not(var_1_42 != 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L177] RET updateVariables() [L178] CALL step() [L53] COND TRUE var_1_6 >= var_1_16 [L54] var_1_22 = (var_1_13 + var_1_13) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L56] COND FALSE !(((var_1_4 + 127.75f) * var_1_13) < var_1_13) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L61] COND FALSE !(var_1_20 < (~ var_1_30)) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L66] COND FALSE !(var_1_13 == var_1_13) [L73] var_1_32 = (((((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))) < 0 ) ? -((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))) : ((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L75] COND TRUE ! (var_1_4 <= var_1_36) [L76] var_1_38 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_38=4, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L78] EXPR (var_1_16 >> 4) & var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_38=4, var_1_40=1279/5, var_1_41=256, var_1_42=-3, var_1_6=10000] [L78] COND TRUE 128 != ((var_1_16 >> 4) & var_1_16) [L79] var_1_40 = ((((var_1_36) > (var_1_4)) ? (var_1_36) : (var_1_4))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=256, var_1_42=-3, var_1_4=0, var_1_6=10000] [L81] COND TRUE (var_1_16 / var_1_42) < var_1_20 [L82] var_1_41 = ((((((((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) < 0 ) ? -((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) : ((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))))) < 0 ) ? -(((((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) < 0 ) ? -((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) : ((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))))) : (((((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) < 0 ) ? -((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))) : ((((var_1_30) > (var_1_6)) ? (var_1_30) : (var_1_6))))))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L86] COND TRUE (var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6 [L87] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L89] COND TRUE (var_1_5 / var_1_11) >= (var_1_8 - var_1_4) [L90] var_1_10 = (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L94] var_1_20 = var_1_16 [L95] var_1_21 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=4, var_1_21=4, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L96] COND TRUE var_1_21 <= (var_1_16 * var_1_20) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=4, var_1_21=4, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L97] COND TRUE (var_1_5 + var_1_14) <= 127.025f [L98] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=4, var_1_21=4, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L105] unsigned char stepLocal_0 = var_1_20 != var_1_20; VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=4, var_1_21=4, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=10000] [L106] COND FALSE !(\read(var_1_17)) [L117] var_1_6 = var_1_20 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=4, var_1_21=4, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=4] [L119] COND TRUE var_1_6 <= var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=4, var_1_21=4, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_6=4] [L120] COND FALSE !(var_1_6 > var_1_6) [L123] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=6, var_1_20=4, var_1_21=4, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_5=6, var_1_6=4] [L128] COND TRUE var_1_1 < var_1_11 [L129] var_1_19 = (var_1_13 - 256.4) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=6, var_1_20=4, var_1_21=4, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_5=6, var_1_6=4] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return ((((((((var_1_6 <= var_1_6) ? ((var_1_6 > var_1_6) ? (var_1_1 == ((float) (var_1_4 - var_1_5))) : (var_1_1 == ((float) var_1_5))) : (var_1_1 == ((float) var_1_4))) && (var_1_17 ? ((((((var_1_14) > (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78))))) ? (var_1_14) : (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78)))))) != (var_1_4 - var_1_8)) ? (((var_1_20 != var_1_20) || var_1_17) ? (var_1_6 == ((unsigned long int) var_1_20)) : (var_1_6 == ((unsigned long int) 5u))) : (var_1_6 == ((unsigned long int) var_1_20))) : (var_1_6 == ((unsigned long int) var_1_20)))) && (((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) ? (var_1_10 == ((float) (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))))) : (var_1_10 == ((float) 4.2f)))) && (((var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6) ? (var_1_14 == ((double) var_1_12)) : 1)) && ((var_1_21 <= (var_1_16 * var_1_20)) ? (((var_1_5 + var_1_14) <= 127.025f) ? (var_1_17 == ((unsigned char) var_1_18)) : (var_1_17 == ((unsigned char) var_1_18))) : (var_1_17 == ((unsigned char) var_1_18)))) && ((var_1_1 < var_1_11) ? (var_1_19 == ((double) (var_1_13 - 256.4))) : 1)) && (var_1_20 == ((unsigned char) var_1_16))) && (var_1_21 == ((unsigned short int) var_1_16)) ; VAL [\result=0, isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=6, var_1_20=4, var_1_21=4, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_5=6, var_1_6=4] [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=6, var_1_20=4, var_1_21=4, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_5=6, var_1_6=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=5, var_1_12=4, var_1_14=4, var_1_15=-1, var_1_16=4, var_1_17=0, var_1_18=0, var_1_1=6, var_1_20=4, var_1_21=4, var_1_27=-64, var_1_30=0, var_1_31=8, var_1_32=2, var_1_36=3, var_1_38=4, var_1_40=3, var_1_41=10000, var_1_42=-3, var_1_4=0, var_1_5=6, var_1_6=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 142 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 137 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 165 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 231 mSDtfsCounter, 165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 394 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 4 NumberOfNonLiveVariables, 650 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2016/2052 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-03-08 12:47:17,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4502a09464b29bf00952bf3323a73b5690388bf06e82f0cd90fbd1bfdf0148c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:47:19,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:47:19,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:47:19,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:47:19,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:47:19,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:47:19,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:47:19,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:47:19,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:47:19,281 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:47:19,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:47:19,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:47:19,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:47:19,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:47:19,282 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:47:19,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:47:19,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:47:19,284 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:47:19,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:47:19,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:47:19,284 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/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 -> d4502a09464b29bf00952bf3323a73b5690388bf06e82f0cd90fbd1bfdf0148c [2025-03-08 12:47:19,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:47:19,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:47:19,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:47:19,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:47:19,534 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:47:19,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i [2025-03-08 12:47:20,678 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4975d12d/5e63759b4e5246088ae8d71d7887673e/FLAG4ae721225 [2025-03-08 12:47:20,913 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:47:20,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i [2025-03-08 12:47:20,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4975d12d/5e63759b4e5246088ae8d71d7887673e/FLAG4ae721225 [2025-03-08 12:47:20,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4975d12d/5e63759b4e5246088ae8d71d7887673e [2025-03-08 12:47:20,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:47:20,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:47:20,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:47:20,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:47:20,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:47:20,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:47:20" (1/1) ... [2025-03-08 12:47:20,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f1a0c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:20, skipping insertion in model container [2025-03-08 12:47:20,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:47:20" (1/1) ... [2025-03-08 12:47:20,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:47:21,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i[918,931] [2025-03-08 12:47:21,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:47:21,134 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:47:21,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i[918,931] [2025-03-08 12:47:21,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:47:21,181 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:47:21,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21 WrapperNode [2025-03-08 12:47:21,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:47:21,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:47:21,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:47:21,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:47:21,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (1/1) ... [2025-03-08 12:47:21,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (1/1) ... [2025-03-08 12:47:21,215 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-03-08 12:47:21,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:47:21,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:47:21,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:47:21,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:47:21,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (1/1) ... [2025-03-08 12:47:21,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (1/1) ... [2025-03-08 12:47:21,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (1/1) ... [2025-03-08 12:47:21,238 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-03-08 12:47:21,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (1/1) ... [2025-03-08 12:47:21,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (1/1) ... [2025-03-08 12:47:21,246 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (1/1) ... [2025-03-08 12:47:21,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (1/1) ... [2025-03-08 12:47:21,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (1/1) ... [2025-03-08 12:47:21,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (1/1) ... [2025-03-08 12:47:21,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:47:21,257 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:47:21,257 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:47:21,257 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:47:21,258 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (1/1) ... [2025-03-08 12:47:21,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:47:21,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:47:21,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:47:21,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:47:21,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:47:21,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:47:21,311 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:47:21,311 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:47:21,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:47:21,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:47:21,384 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:47:21,386 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:47:41,298 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 12:47:41,298 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:47:41,306 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:47:41,307 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:47:41,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:47:41 BoogieIcfgContainer [2025-03-08 12:47:41,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:47:41,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:47:41,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:47:41,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:47:41,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:47:20" (1/3) ... [2025-03-08 12:47:41,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aedc052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:47:41, skipping insertion in model container [2025-03-08 12:47:41,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:47:21" (2/3) ... [2025-03-08 12:47:41,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aedc052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:47:41, skipping insertion in model container [2025-03-08 12:47:41,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:47:41" (3/3) ... [2025-03-08 12:47:41,315 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i [2025-03-08 12:47:41,326 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:47:41,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-2.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:47:41,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:47:41,382 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;@121c4462, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:47:41,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:47:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 12:47:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 12:47:41,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:47:41,405 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:47:41,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:47:41,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:47:41,409 INFO L85 PathProgramCache]: Analyzing trace with hash -454657599, now seen corresponding path program 1 times [2025-03-08 12:47:41,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:47:41,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533448776] [2025-03-08 12:47:41,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:47:41,420 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-03-08 12:47:41,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:47:41,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:47:41,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 12:47:41,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 12:47:42,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 12:47:42,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:47:42,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:47:42,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:47:42,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:47:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-08 12:47:42,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:47:42,253 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:47:42,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533448776] [2025-03-08 12:47:42,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533448776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:47:42,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:47:42,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:47:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912799020] [2025-03-08 12:47:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:47:42,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:47:42,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:47:42,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:47:42,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:47:42,275 INFO L87 Difference]: Start difference. First operand has 72 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 12:47:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:47:42,298 INFO L93 Difference]: Finished difference Result 138 states and 240 transitions. [2025-03-08 12:47:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:47:42,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 131 [2025-03-08 12:47:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:47:42,306 INFO L225 Difference]: With dead ends: 138 [2025-03-08 12:47:42,306 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 12:47:42,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-03-08 12:47:42,313 INFO L435 NwaCegarLoop]: 104 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, 104 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-03-08 12:47:42,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:47:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 12:47:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 12:47:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 12:47:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2025-03-08 12:47:42,349 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 131 [2025-03-08 12:47:42,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:47:42,350 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2025-03-08 12:47:42,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 12:47:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2025-03-08 12:47:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 12:47:42,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:47:42,352 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:47:42,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 12:47:42,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:47:42,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:47:42,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:47:42,554 INFO L85 PathProgramCache]: Analyzing trace with hash 775070178, now seen corresponding path program 1 times [2025-03-08 12:47:42,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:47:42,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410118723] [2025-03-08 12:47:42,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:47:42,554 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-03-08 12:47:42,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:47:42,558 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:47:42,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 12:47:42,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 12:47:43,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 12:47:43,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:47:43,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:47:43,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:47:43,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:47:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 318 proven. 36 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-08 12:47:46,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:47:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 12:47:47,368 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:47:47,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410118723] [2025-03-08 12:47:47,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410118723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:47:47,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:47:47,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-08 12:47:47,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432784444] [2025-03-08 12:47:47,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:47:47,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:47:47,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:47:47,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:47:47,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:47:47,371 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-08 12:47:50,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:47:55,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:47:59,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:48:03,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:48:07,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:48:11,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:48:15,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:48:15,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:15,669 INFO L93 Difference]: Finished difference Result 141 states and 210 transitions. [2025-03-08 12:48:15,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:48:15,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 132 [2025-03-08 12:48:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:15,733 INFO L225 Difference]: With dead ends: 141 [2025-03-08 12:48:15,733 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 12:48:15,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:48:15,734 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 105 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 20 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:15,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 178 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 28.0s Time] [2025-03-08 12:48:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 12:48:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-08 12:48:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 12:48:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions. [2025-03-08 12:48:15,743 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 132 [2025-03-08 12:48:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:15,743 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 105 transitions. [2025-03-08 12:48:15,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-08 12:48:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions. [2025-03-08 12:48:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 12:48:15,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:15,747 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:48:15,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 12:48:15,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:48:15,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:15,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:15,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1998453855, now seen corresponding path program 1 times [2025-03-08 12:48:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:48:15,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165307327] [2025-03-08 12:48:15,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:15,949 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-03-08 12:48:15,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:48:15,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:48:15,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 12:48:15,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 12:48:16,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 12:48:16,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:16,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:16,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:48:16,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:48:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 27 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-08 12:48:17,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:48:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-08 12:48:19,655 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:48:19,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165307327] [2025-03-08 12:48:19,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165307327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:48:19,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:48:19,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-08 12:48:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024521291] [2025-03-08 12:48:19,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:48:19,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 12:48:19,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:48:19,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 12:48:19,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:48:19,656 INFO L87 Difference]: Start difference. First operand 73 states and 105 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 12:48:23,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:48:27,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:48:31,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:48:35,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:48:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:48:36,771 INFO L93 Difference]: Finished difference Result 177 states and 247 transitions. [2025-03-08 12:48:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 12:48:36,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 134 [2025-03-08 12:48:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:48:36,774 INFO L225 Difference]: With dead ends: 177 [2025-03-08 12:48:36,774 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 12:48:36,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:48:36,775 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 132 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:48:36,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 246 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 307 Invalid, 3 Unknown, 0 Unchecked, 16.6s Time] [2025-03-08 12:48:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 12:48:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2025-03-08 12:48:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 12:48:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 139 transitions. [2025-03-08 12:48:36,789 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 139 transitions. Word has length 134 [2025-03-08 12:48:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:48:36,790 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 139 transitions. [2025-03-08 12:48:36,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 12:48:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 139 transitions. [2025-03-08 12:48:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 12:48:36,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:48:36,791 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:48:36,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 12:48:36,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:48:36,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:48:36,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:48:36,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1149936895, now seen corresponding path program 1 times [2025-03-08 12:48:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:48:36,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766092978] [2025-03-08 12:48:36,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:48:36,993 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-03-08 12:48:36,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:48:36,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:48:36,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 12:48:37,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 12:48:38,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 12:48:38,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:48:38,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:48:38,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 12:48:38,137 INFO L279 TraceCheckSpWp]: Computing forward predicates...