./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_codestructure_normal_file-74.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 b1c30a86fefc6335b9d16e82085bfc5f2c862606f595d2c81d4cd01f1bfb7b41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:20:02,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:20:02,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:20:02,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:20:02,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:20:02,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:20:02,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:20:02,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:20:02,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:20:02,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:20:02,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:20:02,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:20:02,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:20:02,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:20:02,555 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:20:02,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:20:02,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:20:02,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:20:02,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:20:02,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:20:02,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:20:02,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:20:02,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:20:02,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:20:02,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:20:02,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:20:02,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:20:02,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:20:02,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:20:02,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:20:02,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:20:02,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:20:02,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:20:02,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:20:02,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:20:02,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:20:02,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:20:02,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:20:02,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:20:02,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:20:02,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:20:02,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:20:02,565 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> b1c30a86fefc6335b9d16e82085bfc5f2c862606f595d2c81d4cd01f1bfb7b41 [2024-11-16 12:20:02,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:20:02,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:20:02,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:20:02,860 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:20:02,860 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:20:02,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-74.i [2024-11-16 12:20:04,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:20:04,542 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:20:04,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-74.i [2024-11-16 12:20:04,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141dad863/2958de1a94e54d3abf85e9e1a1db9e4c/FLAG1c46135a5 [2024-11-16 12:20:04,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141dad863/2958de1a94e54d3abf85e9e1a1db9e4c [2024-11-16 12:20:04,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:20:04,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:20:04,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:20:04,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:20:04,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:20:04,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:04" (1/1) ... [2024-11-16 12:20:04,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7938bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:04, skipping insertion in model container [2024-11-16 12:20:04,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:04" (1/1) ... [2024-11-16 12:20:04,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:20:05,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_codestructure_normal_file-74.i[913,926] [2024-11-16 12:20:05,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:20:05,201 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:20:05,210 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_codestructure_normal_file-74.i[913,926] [2024-11-16 12:20:05,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:20:05,271 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:20:05,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05 WrapperNode [2024-11-16 12:20:05,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:20:05,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:20:05,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:20:05,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:20:05,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (1/1) ... [2024-11-16 12:20:05,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (1/1) ... [2024-11-16 12:20:05,324 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-16 12:20:05,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:20:05,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:20:05,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:20:05,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:20:05,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (1/1) ... [2024-11-16 12:20:05,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (1/1) ... [2024-11-16 12:20:05,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (1/1) ... [2024-11-16 12:20:05,358 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]. [2024-11-16 12:20:05,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (1/1) ... [2024-11-16 12:20:05,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (1/1) ... [2024-11-16 12:20:05,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (1/1) ... [2024-11-16 12:20:05,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (1/1) ... [2024-11-16 12:20:05,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (1/1) ... [2024-11-16 12:20:05,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (1/1) ... [2024-11-16 12:20:05,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:20:05,386 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:20:05,386 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:20:05,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:20:05,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (1/1) ... [2024-11-16 12:20:05,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:20:05,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:20:05,422 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) [2024-11-16 12:20:05,425 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 [2024-11-16 12:20:05,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:20:05,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:20:05,476 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:20:05,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:20:05,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:20:05,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:20:05,574 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:20:05,576 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:20:05,896 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L139: havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short24#1; [2024-11-16 12:20:05,950 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-16 12:20:05,953 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:20:05,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:20:05,978 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-16 12:20:05,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:20:05 BoogieIcfgContainer [2024-11-16 12:20:05,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:20:05,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:20:05,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:20:05,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:20:05,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:20:04" (1/3) ... [2024-11-16 12:20:05,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfb9e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:20:05, skipping insertion in model container [2024-11-16 12:20:05,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:05" (2/3) ... [2024-11-16 12:20:05,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfb9e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:20:05, skipping insertion in model container [2024-11-16 12:20:05,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:20:05" (3/3) ... [2024-11-16 12:20:05,990 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-74.i [2024-11-16 12:20:06,003 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:20:06,004 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:20:06,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:20:06,074 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;@5590b91d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:20:06,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:20:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 57 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:20:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 12:20:06,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:20:06,092 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:20:06,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:20:06,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:20:06,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2048908089, now seen corresponding path program 1 times [2024-11-16 12:20:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:20:06,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205963140] [2024-11-16 12:20:06,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:20:06,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:20:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:20:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:20:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:20:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:20:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:20:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:20:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:20:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:20:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:20:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:20:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:20:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:20:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:20:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:20:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:20:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:20:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:20:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:20:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:20:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:20:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:20:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:20:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:20:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:20:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:20:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:20:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 12:20:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 12:20:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 12:20:06,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:20:06,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205963140] [2024-11-16 12:20:06,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205963140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:20:06,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:20:06,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:20:06,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831518562] [2024-11-16 12:20:06,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:20:06,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:20:06,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:20:06,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:20:06,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:20:06,581 INFO L87 Difference]: Start difference. First operand has 87 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 57 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 12:20:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:20:06,619 INFO L93 Difference]: Finished difference Result 166 states and 285 transitions. [2024-11-16 12:20:06,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:20:06,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 176 [2024-11-16 12:20:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:20:06,632 INFO L225 Difference]: With dead ends: 166 [2024-11-16 12:20:06,632 INFO L226 Difference]: Without dead ends: 82 [2024-11-16 12:20:06,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:20:06,642 INFO L432 NwaCegarLoop]: 122 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, 122 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 [2024-11-16 12:20:06,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:20:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-16 12:20:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-16 12:20:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:20:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-11-16 12:20:06,698 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 176 [2024-11-16 12:20:06,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:20:06,698 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-11-16 12:20:06,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 12:20:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-11-16 12:20:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 12:20:06,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:20:06,707 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:20:06,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:20:06,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:20:06,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:20:06,709 INFO L85 PathProgramCache]: Analyzing trace with hash 265096749, now seen corresponding path program 1 times [2024-11-16 12:20:06,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:20:06,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947331132] [2024-11-16 12:20:06,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:20:06,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:20:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:20:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:20:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:20:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:20:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:20:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:20:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:20:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:20:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:20:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:20:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:20:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:20:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:20:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:20:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:06,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:20:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:20:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:20:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:20:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:20:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:20:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:20:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:20:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:20:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:20:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:20:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:20:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 12:20:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 12:20:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:07,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 12:20:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:20:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947331132] [2024-11-16 12:20:07,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947331132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:20:07,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:20:07,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:20:07,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599699260] [2024-11-16 12:20:07,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:20:07,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:20:07,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:20:07,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:20:07,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:20:07,060 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:20:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:20:07,122 INFO L93 Difference]: Finished difference Result 205 states and 307 transitions. [2024-11-16 12:20:07,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:20:07,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-11-16 12:20:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:20:07,126 INFO L225 Difference]: With dead ends: 205 [2024-11-16 12:20:07,126 INFO L226 Difference]: Without dead ends: 126 [2024-11-16 12:20:07,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:20:07,132 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 62 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:20:07,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 229 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:20:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-16 12:20:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2024-11-16 12:20:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 78 states have internal predecessors, (98), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 12:20:07,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 182 transitions. [2024-11-16 12:20:07,167 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 182 transitions. Word has length 176 [2024-11-16 12:20:07,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:20:07,168 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 182 transitions. [2024-11-16 12:20:07,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:20:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 182 transitions. [2024-11-16 12:20:07,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-16 12:20:07,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:20:07,173 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:20:07,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:20:07,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:20:07,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:20:07,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1542357714, now seen corresponding path program 1 times [2024-11-16 12:20:07,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:20:07,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444937027] [2024-11-16 12:20:07,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:20:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:20:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:20:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:20:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:20:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:20:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:20:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:20:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:20:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:20:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:20:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:20:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:20:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:20:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:20:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:20:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:20:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:20:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:20:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:20:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:20:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:20:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:20:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:20:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:20:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:20:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:20:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:20:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 12:20:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 12:20:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 12:20:08,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:20:08,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444937027] [2024-11-16 12:20:08,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444937027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:20:08,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:20:08,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:20:08,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957955010] [2024-11-16 12:20:08,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:20:08,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:20:08,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:20:08,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:20:08,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:20:08,372 INFO L87 Difference]: Start difference. First operand 122 states and 182 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:20:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:20:08,666 INFO L93 Difference]: Finished difference Result 327 states and 481 transitions. [2024-11-16 12:20:08,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:20:08,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-11-16 12:20:08,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:20:08,675 INFO L225 Difference]: With dead ends: 327 [2024-11-16 12:20:08,676 INFO L226 Difference]: Without dead ends: 208 [2024-11-16 12:20:08,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:20:08,678 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 100 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:20:08,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 553 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:20:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-16 12:20:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 139. [2024-11-16 12:20:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 95 states have internal predecessors, (126), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 12:20:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 210 transitions. [2024-11-16 12:20:08,708 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 210 transitions. Word has length 176 [2024-11-16 12:20:08,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:20:08,712 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 210 transitions. [2024-11-16 12:20:08,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:20:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 210 transitions. [2024-11-16 12:20:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-16 12:20:08,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:20:08,719 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:20:08,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:20:08,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:20:08,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:20:08,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1291296595, now seen corresponding path program 1 times [2024-11-16 12:20:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:20:08,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4085478] [2024-11-16 12:20:08,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:20:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:20:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:20:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:20:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:20:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:20:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:20:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:20:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:20:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:20:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:20:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:20:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:20:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:20:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:20:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:20:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:20:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:20:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:20:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:20:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:20:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:20:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:20:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:20:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:20:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 12:20:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:20:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:20:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 12:20:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 12:20:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 12:20:09,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:20:09,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4085478] [2024-11-16 12:20:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4085478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:20:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:20:09,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 12:20:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352597407] [2024-11-16 12:20:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:20:09,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 12:20:09,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:20:09,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 12:20:09,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:20:09,900 INFO L87 Difference]: Start difference. First operand 139 states and 210 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:20:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:20:10,495 INFO L93 Difference]: Finished difference Result 389 states and 566 transitions. [2024-11-16 12:20:10,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:20:10,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-11-16 12:20:10,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:20:10,500 INFO L225 Difference]: With dead ends: 389 [2024-11-16 12:20:10,501 INFO L226 Difference]: Without dead ends: 253 [2024-11-16 12:20:10,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:20:10,506 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 144 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:20:10,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 498 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:20:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-16 12:20:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 122. [2024-11-16 12:20:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 78 states have internal predecessors, (96), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 12:20:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-16 12:20:10,535 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 177 [2024-11-16 12:20:10,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:20:10,536 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-16 12:20:10,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:20:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-16 12:20:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-16 12:20:10,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:20:10,540 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:20:10,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:20:10,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:20:10,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:20:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash -148072139, now seen corresponding path program 1 times [2024-11-16 12:20:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:20:10,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452471512] [2024-11-16 12:20:10,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:20:10,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:20:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:20:10,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [795013637] [2024-11-16 12:20:10,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:20:10,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:20:10,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:20:10,611 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) [2024-11-16 12:20:10,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 12:20:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:20:10,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:20:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:20:10,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:20:10,904 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:20:10,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:20:10,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 12:20:11,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:20:11,110 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 12:20:11,218 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:20:11,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:20:11 BoogieIcfgContainer [2024-11-16 12:20:11,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:20:11,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:20:11,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:20:11,222 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:20:11,222 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:20:05" (3/4) ... [2024-11-16 12:20:11,225 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:20:11,226 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:20:11,226 INFO L158 Benchmark]: Toolchain (without parser) took 6306.51ms. Allocated memory was 161.5MB in the beginning and 257.9MB in the end (delta: 96.5MB). Free memory was 91.0MB in the beginning and 133.3MB in the end (delta: -42.3MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2024-11-16 12:20:11,227 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:20:11,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.17ms. Allocated memory is still 161.5MB. Free memory was 90.7MB in the beginning and 123.7MB in the end (delta: -33.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 12:20:11,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.49ms. Allocated memory is still 161.5MB. Free memory was 123.7MB in the beginning and 120.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:20:11,228 INFO L158 Benchmark]: Boogie Preprocessor took 59.38ms. Allocated memory is still 161.5MB. Free memory was 120.9MB in the beginning and 118.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:20:11,228 INFO L158 Benchmark]: IcfgBuilder took 592.92ms. Allocated memory is still 161.5MB. Free memory was 118.0MB in the beginning and 95.8MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 12:20:11,228 INFO L158 Benchmark]: TraceAbstraction took 5239.63ms. Allocated memory was 161.5MB in the beginning and 257.9MB in the end (delta: 96.5MB). Free memory was 95.5MB in the beginning and 134.4MB in the end (delta: -38.9MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2024-11-16 12:20:11,229 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 257.9MB. Free memory was 134.4MB in the beginning and 133.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:20:11,230 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.17ms. Allocated memory is still 161.5MB. Free memory was 90.7MB in the beginning and 123.7MB in the end (delta: -33.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.49ms. Allocated memory is still 161.5MB. Free memory was 123.7MB in the beginning and 120.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.38ms. Allocated memory is still 161.5MB. Free memory was 120.9MB in the beginning and 118.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 592.92ms. Allocated memory is still 161.5MB. Free memory was 118.0MB in the beginning and 95.8MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5239.63ms. Allocated memory was 161.5MB in the beginning and 257.9MB in the end (delta: 96.5MB). Free memory was 95.5MB in the beginning and 134.4MB in the end (delta: -38.9MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 257.9MB. Free memory was 134.4MB in the beginning and 133.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryArithmeticFLOAToperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] signed long int var_1_2 = -1; [L24] signed long int var_1_3 = -2; [L25] unsigned char var_1_4 = 0; [L26] unsigned long int var_1_5 = 3914692693; [L27] unsigned long int var_1_6 = 32; [L28] unsigned long int var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 50; [L33] signed long int var_1_12 = 25; [L34] signed long int var_1_13 = 1; [L35] float var_1_15 = 4.75; [L36] unsigned char var_1_16 = 100; [L37] float var_1_17 = 50.1; [L38] float var_1_18 = 100.9; [L39] float var_1_19 = 8.5; [L40] float var_1_20 = 10.625; [L41] float var_1_21 = 0.0; [L42] float var_1_22 = 7.8; [L43] float var_1_23 = 8.25; [L44] double var_1_24 = 5.5; VAL [isInitial=0, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=-1, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L93] var_1_3 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L99] var_1_5 = __VERIFIER_nondet_ulong() [L100] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L101] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L102] var_1_6 = __VERIFIER_nondet_ulong() [L103] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L104] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L104] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L105] var_1_7 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_8=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_8=0, var_1_9=0] [L107] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L107] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L108] var_1_9 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0] [L109] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0] [L110] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L114] var_1_12 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L115] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L116] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L116] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L117] var_1_13 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L119] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L119] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L122] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L122] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L123] var_1_17 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L124] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L125] var_1_19 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L126] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L127] var_1_20 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L128] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L129] var_1_21 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L130] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L131] var_1_22 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L132] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L133] var_1_23 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L134] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L147] RET updateVariables() [L148] CALL step() [L48] COND FALSE !(! (var_1_2 >= var_1_3)) [L55] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L57] COND FALSE !(var_1_6 < var_1_3) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L62] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_4)) [L73] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L75] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L80] COND FALSE !(\read(var_1_10)) [L83] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L85] COND TRUE (~ var_1_3) <= (var_1_12 - var_1_11) [L86] var_1_24 = var_1_22 VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139] EXPR (! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139] EXPR (((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139-L140] return ((((((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_11 > (var_1_6 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_3) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=0, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 5, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 1402 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 925 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 477 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=3, InterpolantAutomatonStates: 22, 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, 4 MinimizatonAttempts, 204 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1061 NumberOfCodeBlocks, 1061 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 701 ConstructedInterpolants, 0 QuantifiedInterpolants, 1215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 6048/6048 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 12:20:11,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_codestructure_normal_file-74.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 b1c30a86fefc6335b9d16e82085bfc5f2c862606f595d2c81d4cd01f1bfb7b41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:20:13,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:20:13,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:20:13,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:20:13,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:20:13,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:20:13,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:20:13,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:20:13,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:20:13,565 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:20:13,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:20:13,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:20:13,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:20:13,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:20:13,568 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:20:13,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:20:13,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:20:13,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:20:13,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:20:13,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:20:13,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:20:13,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:20:13,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:20:13,574 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:20:13,574 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:20:13,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:20:13,575 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:20:13,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:20:13,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:20:13,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:20:13,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:20:13,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:20:13,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:20:13,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:20:13,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:20:13,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:20:13,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:20:13,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:20:13,579 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:20:13,579 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:20:13,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:20:13,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:20:13,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:20:13,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:20:13,580 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> b1c30a86fefc6335b9d16e82085bfc5f2c862606f595d2c81d4cd01f1bfb7b41 [2024-11-16 12:20:13,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:20:13,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:20:13,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:20:13,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:20:13,906 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:20:13,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-74.i [2024-11-16 12:20:15,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:20:15,675 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:20:15,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-74.i [2024-11-16 12:20:15,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/294a3448b/86d0e4bbfda84b4c82d45f1e637258fe/FLAG636554f39 [2024-11-16 12:20:16,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/294a3448b/86d0e4bbfda84b4c82d45f1e637258fe [2024-11-16 12:20:16,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:20:16,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:20:16,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:20:16,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:20:16,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:20:16,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3fe1a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16, skipping insertion in model container [2024-11-16 12:20:16,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:20:16,297 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_codestructure_normal_file-74.i[913,926] [2024-11-16 12:20:16,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:20:16,395 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:20:16,408 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_codestructure_normal_file-74.i[913,926] [2024-11-16 12:20:16,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:20:16,467 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:20:16,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16 WrapperNode [2024-11-16 12:20:16,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:20:16,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:20:16,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:20:16,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:20:16,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,524 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-11-16 12:20:16,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:20:16,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:20:16,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:20:16,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:20:16,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,571 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]. [2024-11-16 12:20:16,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,586 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:20:16,606 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:20:16,606 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:20:16,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:20:16,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (1/1) ... [2024-11-16 12:20:16,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:20:16,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:20:16,642 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) [2024-11-16 12:20:16,646 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 [2024-11-16 12:20:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:20:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:20:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:20:16,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:20:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:20:16,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:20:16,806 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:20:16,810 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:20:19,343 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:20:19,344 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:20:19,358 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:20:19,358 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:20:19,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:20:19 BoogieIcfgContainer [2024-11-16 12:20:19,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:20:19,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:20:19,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:20:19,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:20:19,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:20:16" (1/3) ... [2024-11-16 12:20:19,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5070f8dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:20:19, skipping insertion in model container [2024-11-16 12:20:19,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:16" (2/3) ... [2024-11-16 12:20:19,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5070f8dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:20:19, skipping insertion in model container [2024-11-16 12:20:19,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:20:19" (3/3) ... [2024-11-16 12:20:19,366 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-74.i [2024-11-16 12:20:19,383 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:20:19,383 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:20:19,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:20:19,455 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;@3eb6c39a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:20:19,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:20:19,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:20:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 12:20:19,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:20:19,474 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:20:19,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:20:19,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:20:19,479 INFO L85 PathProgramCache]: Analyzing trace with hash 618082513, now seen corresponding path program 1 times [2024-11-16 12:20:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:20:19,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34487088] [2024-11-16 12:20:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:20:19,491 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 [2024-11-16 12:20:19,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:20:19,494 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) [2024-11-16 12:20:19,495 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 [2024-11-16 12:20:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:19,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:20:19,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:20:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-16 12:20:19,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:20:19,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:20:19,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34487088] [2024-11-16 12:20:19,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34487088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:20:19,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:20:19,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:20:19,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23973559] [2024-11-16 12:20:19,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:20:19,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:20:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:20:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:20:19,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:20:19,975 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 48 states have internal predecessors, (63), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 12:20:20,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:20:20,008 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2024-11-16 12:20:20,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:20:20,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 174 [2024-11-16 12:20:20,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:20:20,016 INFO L225 Difference]: With dead ends: 148 [2024-11-16 12:20:20,016 INFO L226 Difference]: Without dead ends: 73 [2024-11-16 12:20:20,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:20:20,023 INFO L432 NwaCegarLoop]: 111 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, 111 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 [2024-11-16 12:20:20,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:20:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-16 12:20:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-16 12:20:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:20:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2024-11-16 12:20:20,078 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 174 [2024-11-16 12:20:20,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:20:20,080 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2024-11-16 12:20:20,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 12:20:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2024-11-16 12:20:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 12:20:20,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:20:20,086 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:20:20,098 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-16 12:20:20,286 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 [2024-11-16 12:20:20,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:20:20,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:20:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1335573431, now seen corresponding path program 1 times [2024-11-16 12:20:20,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:20:20,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165653200] [2024-11-16 12:20:20,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:20:20,290 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 [2024-11-16 12:20:20,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:20:20,293 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) [2024-11-16 12:20:20,295 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 [2024-11-16 12:20:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:20,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 12:20:20,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:20:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 777 proven. 36 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-11-16 12:20:21,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:20:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 12:20:21,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:20:21,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165653200] [2024-11-16 12:20:21,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165653200] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:20:21,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:20:21,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-16 12:20:21,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295782479] [2024-11-16 12:20:21,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:20:21,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:20:21,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:20:21,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:20:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:20:21,709 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-16 12:20:24,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:20:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:20:24,891 INFO L93 Difference]: Finished difference Result 150 states and 224 transitions. [2024-11-16 12:20:24,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 12:20:24,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 174 [2024-11-16 12:20:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:20:24,914 INFO L225 Difference]: With dead ends: 150 [2024-11-16 12:20:24,914 INFO L226 Difference]: Without dead ends: 80 [2024-11-16 12:20:24,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:20:24,916 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 48 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:20:24,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 161 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-16 12:20:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-16 12:20:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-16 12:20:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:20:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2024-11-16 12:20:24,936 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 110 transitions. Word has length 174 [2024-11-16 12:20:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:20:24,940 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 110 transitions. [2024-11-16 12:20:24,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-11-16 12:20:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2024-11-16 12:20:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 12:20:24,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:20:24,946 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:20:24,959 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 [2024-11-16 12:20:25,146 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 [2024-11-16 12:20:25,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:20:25,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:20:25,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2071890184, now seen corresponding path program 1 times [2024-11-16 12:20:25,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:20:25,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192743007] [2024-11-16 12:20:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:20:25,149 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 [2024-11-16 12:20:25,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:20:25,152 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) [2024-11-16 12:20:25,153 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 [2024-11-16 12:20:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:20:25,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-16 12:20:25,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:21:09,530 WARN L286 SmtUtils]: Spent 16.16s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)