./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.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 f8c7f093a0092c99d535dacf9ec847d585a162cf9e23f66317fd8ccac5a76f81 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:06:35,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:06:35,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:06:35,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:06:35,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:06:35,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:06:35,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:06:35,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:06:35,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:06:35,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:06:35,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:06:35,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:06:35,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:06:35,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:06:35,928 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:06:35,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:06:35,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:06:35,929 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:06:35,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:06:35,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:06:35,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:06:35,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:06:35,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:06:35,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:06:35,931 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:06:35,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:06:35,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:06:35,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:06:35,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:06:35,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:06:35,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:06:35,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:06:35,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:06:35,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:06:35,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:06:35,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:06:35,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:06:35,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:06:35,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:06:35,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:06:35,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:06:35,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:06:35,935 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 -> f8c7f093a0092c99d535dacf9ec847d585a162cf9e23f66317fd8ccac5a76f81 [2024-10-14 09:06:36,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:06:36,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:06:36,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:06:36,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:06:36,172 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:06:36,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-10-14 09:06:37,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:06:37,580 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:06:37,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-10-14 09:06:37,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df0b894d/acdb712c54e94bcc9f6a826309c5c20e/FLAGdfeeb35aa [2024-10-14 09:06:37,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5df0b894d/acdb712c54e94bcc9f6a826309c5c20e [2024-10-14 09:06:37,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:06:37,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:06:37,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:06:37,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:06:37,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:06:37,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:06:37" (1/1) ... [2024-10-14 09:06:37,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac493b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:37, skipping insertion in model container [2024-10-14 09:06:37,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:06:37" (1/1) ... [2024-10-14 09:06:38,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:06:38,142 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i[919,932] [2024-10-14 09:06:38,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:06:38,236 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:06:38,250 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i[919,932] [2024-10-14 09:06:38,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:06:38,289 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:06:38,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38 WrapperNode [2024-10-14 09:06:38,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:06:38,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:06:38,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:06:38,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:06:38,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (1/1) ... [2024-10-14 09:06:38,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (1/1) ... [2024-10-14 09:06:38,334 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-10-14 09:06:38,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:06:38,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:06:38,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:06:38,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:06:38,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (1/1) ... [2024-10-14 09:06:38,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (1/1) ... [2024-10-14 09:06:38,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (1/1) ... [2024-10-14 09:06:38,366 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-10-14 09:06:38,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (1/1) ... [2024-10-14 09:06:38,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (1/1) ... [2024-10-14 09:06:38,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (1/1) ... [2024-10-14 09:06:38,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (1/1) ... [2024-10-14 09:06:38,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (1/1) ... [2024-10-14 09:06:38,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (1/1) ... [2024-10-14 09:06:38,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:06:38,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:06:38,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:06:38,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:06:38,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (1/1) ... [2024-10-14 09:06:38,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:06:38,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:06:38,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-10-14 09:06:38,424 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-10-14 09:06:38,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:06:38,461 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:06:38,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:06:38,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:06:38,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:06:38,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:06:38,562 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:06:38,568 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:06:38,912 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 09:06:38,912 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:06:38,937 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:06:38,937 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:06:38,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:06:38 BoogieIcfgContainer [2024-10-14 09:06:38,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:06:38,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:06:38,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:06:38,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:06:38,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:06:37" (1/3) ... [2024-10-14 09:06:38,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734ade0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:06:38, skipping insertion in model container [2024-10-14 09:06:38,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:38" (2/3) ... [2024-10-14 09:06:38,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734ade0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:06:38, skipping insertion in model container [2024-10-14 09:06:38,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:06:38" (3/3) ... [2024-10-14 09:06:38,947 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-10-14 09:06:38,964 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:06:38,964 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:06:39,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:06:39,017 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;@507dc61a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:06:39,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:06:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 70 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 09:06:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 09:06:39,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:39,035 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:39,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:39,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash 892013310, now seen corresponding path program 1 times [2024-10-14 09:06:39,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:06:39,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675828925] [2024-10-14 09:06:39,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:39,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:06:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:06:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:06:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:06:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:06:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:06:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:06:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:06:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:06:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:06:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:06:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:06:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:06:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:06:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:06:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:06:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:06:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:06:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:06:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:06:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 09:06:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 09:06:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:06:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:06:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:06:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 09:06:39,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:06:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675828925] [2024-10-14 09:06:39,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675828925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:06:39,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:06:39,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:06:39,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860989746] [2024-10-14 09:06:39,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:06:39,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:06:39,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:06:39,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:06:39,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:06:39,455 INFO L87 Difference]: Start difference. First operand has 96 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 70 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 09:06:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:06:39,484 INFO L93 Difference]: Finished difference Result 189 states and 332 transitions. [2024-10-14 09:06:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:06:39,486 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-10-14 09:06:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:06:39,492 INFO L225 Difference]: With dead ends: 189 [2024-10-14 09:06:39,492 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 09:06:39,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-10-14 09:06:39,499 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:06:39,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:06:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 09:06:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 09:06:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 09:06:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 148 transitions. [2024-10-14 09:06:39,540 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 148 transitions. Word has length 161 [2024-10-14 09:06:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:06:39,540 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 148 transitions. [2024-10-14 09:06:39,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 09:06:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 148 transitions. [2024-10-14 09:06:39,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 09:06:39,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:39,544 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:39,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:06:39,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:39,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:39,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1424708546, now seen corresponding path program 1 times [2024-10-14 09:06:39,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:06:39,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973938584] [2024-10-14 09:06:39,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:39,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:06:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:06:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:06:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:06:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:06:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:06:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:06:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:06:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:06:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:06:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:06:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:06:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:06:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:06:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:06:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:06:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:06:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:06:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:06:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:06:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 09:06:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 09:06:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:06:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:06:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:06:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 09:06:39,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:06:39,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973938584] [2024-10-14 09:06:39,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973938584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:06:39,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:06:39,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:06:39,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658468964] [2024-10-14 09:06:39,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:06:39,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:06:39,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:06:39,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:06:39,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:06:39,814 INFO L87 Difference]: Start difference. First operand 94 states and 148 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 09:06:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:06:39,839 INFO L93 Difference]: Finished difference Result 187 states and 295 transitions. [2024-10-14 09:06:39,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:06:39,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-14 09:06:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:06:39,841 INFO L225 Difference]: With dead ends: 187 [2024-10-14 09:06:39,841 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 09:06:39,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-10-14 09:06:39,845 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:06:39,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:06:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 09:06:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 09:06:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 68 states have internal predecessors, (99), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 09:06:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2024-10-14 09:06:39,858 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 161 [2024-10-14 09:06:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:06:39,859 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2024-10-14 09:06:39,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 09:06:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2024-10-14 09:06:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 09:06:39,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:39,861 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:39,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:06:39,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:39,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1486748160, now seen corresponding path program 1 times [2024-10-14 09:06:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:06:39,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148968909] [2024-10-14 09:06:39,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:39,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:06:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:06:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:06:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:06:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:06:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:06:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:06:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:06:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:06:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:06:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:06:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:06:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:06:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:06:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:06:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:06:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:06:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:06:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:06:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:06:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 09:06:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 09:06:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:06:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:06:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:06:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 09:06:40,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:06:40,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148968909] [2024-10-14 09:06:40,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148968909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:06:40,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:06:40,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:06:40,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713211071] [2024-10-14 09:06:40,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:06:40,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:06:40,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:06:40,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:06:40,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:06:40,223 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 09:06:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:06:40,401 INFO L93 Difference]: Finished difference Result 279 states and 437 transitions. [2024-10-14 09:06:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:06:40,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-14 09:06:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:06:40,404 INFO L225 Difference]: With dead ends: 279 [2024-10-14 09:06:40,404 INFO L226 Difference]: Without dead ends: 186 [2024-10-14 09:06:40,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:06:40,407 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 124 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:06:40,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 367 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:06:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-14 09:06:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 128. [2024-10-14 09:06:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.5392156862745099) internal successors, (157), 102 states have internal predecessors, (157), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 09:06:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 205 transitions. [2024-10-14 09:06:40,423 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 205 transitions. Word has length 161 [2024-10-14 09:06:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:06:40,423 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 205 transitions. [2024-10-14 09:06:40,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 09:06:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 205 transitions. [2024-10-14 09:06:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 09:06:40,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:40,429 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:40,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:06:40,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:40,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1620761666, now seen corresponding path program 1 times [2024-10-14 09:06:40,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:06:40,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57812399] [2024-10-14 09:06:40,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:40,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:06:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:06:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:06:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:06:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:06:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:06:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:06:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:06:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:06:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:06:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:06:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:06:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:06:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:06:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:06:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:06:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:06:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:06:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:06:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:06:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 09:06:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 09:06:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:06:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:06:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:06:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 09:06:40,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:06:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57812399] [2024-10-14 09:06:40,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57812399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:06:40,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:06:40,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:06:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355850709] [2024-10-14 09:06:40,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:06:40,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:06:40,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:06:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:06:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:06:40,839 INFO L87 Difference]: Start difference. First operand 128 states and 205 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 09:06:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:06:40,959 INFO L93 Difference]: Finished difference Result 255 states and 409 transitions. [2024-10-14 09:06:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:06:40,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-14 09:06:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:06:40,963 INFO L225 Difference]: With dead ends: 255 [2024-10-14 09:06:40,963 INFO L226 Difference]: Without dead ends: 128 [2024-10-14 09:06:40,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:06:40,966 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 104 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:06:40,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 224 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:06:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-14 09:06:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-14 09:06:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.5196078431372548) internal successors, (155), 102 states have internal predecessors, (155), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 09:06:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2024-10-14 09:06:40,981 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 203 transitions. Word has length 161 [2024-10-14 09:06:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:06:40,983 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 203 transitions. [2024-10-14 09:06:40,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 09:06:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 203 transitions. [2024-10-14 09:06:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 09:06:40,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:40,987 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:40,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:06:40,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:40,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1839616384, now seen corresponding path program 1 times [2024-10-14 09:06:40,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:06:40,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643169640] [2024-10-14 09:06:40,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:40,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:06:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:06:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:06:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:06:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:06:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:06:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:06:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:06:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:06:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:06:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:06:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:06:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:06:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:06:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:06:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:06:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:06:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:06:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:06:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:06:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 09:06:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 09:06:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:06:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:06:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:06:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 09:06:41,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:06:41,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643169640] [2024-10-14 09:06:41,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643169640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:06:41,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:06:41,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:06:41,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591762521] [2024-10-14 09:06:41,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:06:41,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:06:41,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:06:41,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:06:41,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:06:41,170 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 09:06:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:06:41,228 INFO L93 Difference]: Finished difference Result 255 states and 405 transitions. [2024-10-14 09:06:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:06:41,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-10-14 09:06:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:06:41,230 INFO L225 Difference]: With dead ends: 255 [2024-10-14 09:06:41,230 INFO L226 Difference]: Without dead ends: 128 [2024-10-14 09:06:41,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:06:41,231 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:06:41,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:06:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-14 09:06:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-14 09:06:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.5) internal successors, (153), 102 states have internal predecessors, (153), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 09:06:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 201 transitions. [2024-10-14 09:06:41,239 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 201 transitions. Word has length 161 [2024-10-14 09:06:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:06:41,240 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 201 transitions. [2024-10-14 09:06:41,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 09:06:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 201 transitions. [2024-10-14 09:06:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 09:06:41,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:41,241 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:41,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 09:06:41,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:41,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:41,242 INFO L85 PathProgramCache]: Analyzing trace with hash -680343550, now seen corresponding path program 1 times [2024-10-14 09:06:41,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:06:41,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15451985] [2024-10-14 09:06:41,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:41,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:06:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:06:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:06:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:06:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:06:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:06:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:06:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:06:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:06:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:06:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:06:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:06:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:06:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:06:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:06:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:06:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:06:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:06:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:06:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 09:06:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 09:06:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 09:06:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:06:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:06:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:06:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 09:06:41,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:06:41,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15451985] [2024-10-14 09:06:41,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15451985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:06:41,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:06:41,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:06:41,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918850818] [2024-10-14 09:06:41,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:06:41,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:06:41,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:06:41,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:06:41,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:06:41,504 INFO L87 Difference]: Start difference. First operand 128 states and 201 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 09:06:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:06:41,762 INFO L93 Difference]: Finished difference Result 313 states and 486 transitions. [2024-10-14 09:06:41,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:06:41,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-14 09:06:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:06:41,764 INFO L225 Difference]: With dead ends: 313 [2024-10-14 09:06:41,764 INFO L226 Difference]: Without dead ends: 186 [2024-10-14 09:06:41,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:06:41,765 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 191 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:06:41,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 323 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:06:41,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-14 09:06:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 133. [2024-10-14 09:06:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 107 states have internal predecessors, (158), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 09:06:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 206 transitions. [2024-10-14 09:06:41,781 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 206 transitions. Word has length 161 [2024-10-14 09:06:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:06:41,782 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 206 transitions. [2024-10-14 09:06:41,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 09:06:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 206 transitions. [2024-10-14 09:06:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-14 09:06:41,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:41,783 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:41,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 09:06:41,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:41,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1964241248, now seen corresponding path program 1 times [2024-10-14 09:06:41,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:06:41,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405024650] [2024-10-14 09:06:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:06:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:06:41,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124558183] [2024-10-14 09:06:41,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:41,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:06:41,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:06:41,867 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-10-14 09:06:41,868 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-10-14 09:06:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:42,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 09:06:42,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:06:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-10-14 09:06:42,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:06:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-14 09:06:43,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:06:43,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405024650] [2024-10-14 09:06:43,862 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 09:06:43,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124558183] [2024-10-14 09:06:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124558183] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:06:43,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:06:43,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-10-14 09:06:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226041613] [2024-10-14 09:06:43,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:06:43,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 09:06:43,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:06:43,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 09:06:43,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-14 09:06:43,866 INFO L87 Difference]: Start difference. First operand 133 states and 206 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-10-14 09:06:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:06:45,240 INFO L93 Difference]: Finished difference Result 395 states and 591 transitions. [2024-10-14 09:06:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 09:06:45,240 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 163 [2024-10-14 09:06:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:06:45,242 INFO L225 Difference]: With dead ends: 395 [2024-10-14 09:06:45,242 INFO L226 Difference]: Without dead ends: 263 [2024-10-14 09:06:45,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 09:06:45,243 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 572 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:06:45,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 328 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 09:06:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-14 09:06:45,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 190. [2024-10-14 09:06:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 162 states have (on average 1.5) internal successors, (243), 162 states have internal predecessors, (243), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 09:06:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 291 transitions. [2024-10-14 09:06:45,261 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 291 transitions. Word has length 163 [2024-10-14 09:06:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:06:45,264 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 291 transitions. [2024-10-14 09:06:45,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-10-14 09:06:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 291 transitions. [2024-10-14 09:06:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 09:06:45,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:45,265 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:45,280 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-10-14 09:06:45,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:06:45,466 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:45,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:45,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1049786570, now seen corresponding path program 1 times [2024-10-14 09:06:45,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:06:45,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039829767] [2024-10-14 09:06:45,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:45,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:06:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:06:45,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1810144109] [2024-10-14 09:06:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:45,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:06:45,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:06:45,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:06:45,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 09:06:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:45,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 09:06:45,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:06:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 473 proven. 30 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-10-14 09:06:46,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:06:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 102 proven. 33 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-14 09:06:49,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:06:49,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039829767] [2024-10-14 09:06:49,043 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 09:06:49,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810144109] [2024-10-14 09:06:49,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810144109] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:06:49,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:06:49,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-14 09:06:49,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887868865] [2024-10-14 09:06:49,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:06:49,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 09:06:49,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:06:49,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 09:06:49,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=273, Unknown=8, NotChecked=0, Total=380 [2024-10-14 09:06:49,047 INFO L87 Difference]: Start difference. First operand 190 states and 291 transitions. Second operand has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 5 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (31), 5 states have call predecessors, (31), 5 states have call successors, (31) [2024-10-14 09:06:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:06:50,099 INFO L93 Difference]: Finished difference Result 397 states and 592 transitions. [2024-10-14 09:06:50,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 09:06:50,100 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 5 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (31), 5 states have call predecessors, (31), 5 states have call successors, (31) Word has length 164 [2024-10-14 09:06:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:06:50,101 INFO L225 Difference]: With dead ends: 397 [2024-10-14 09:06:50,101 INFO L226 Difference]: Without dead ends: 208 [2024-10-14 09:06:50,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=267, Invalid=595, Unknown=8, NotChecked=0, Total=870 [2024-10-14 09:06:50,102 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 242 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 09:06:50,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 374 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 09:06:50,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-14 09:06:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 198. [2024-10-14 09:06:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.437125748502994) internal successors, (240), 167 states have internal predecessors, (240), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 09:06:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 288 transitions. [2024-10-14 09:06:50,124 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 288 transitions. Word has length 164 [2024-10-14 09:06:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:06:50,125 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 288 transitions. [2024-10-14 09:06:50,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 5 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (31), 5 states have call predecessors, (31), 5 states have call successors, (31) [2024-10-14 09:06:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 288 transitions. [2024-10-14 09:06:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 09:06:50,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:50,126 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:50,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 09:06:50,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-14 09:06:50,327 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:50,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash 395281974, now seen corresponding path program 1 times [2024-10-14 09:06:50,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:06:50,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346286893] [2024-10-14 09:06:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:50,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:06:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:06:50,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574719695] [2024-10-14 09:06:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:50,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:06:50,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:06:50,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:06:50,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 09:06:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:06:50,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:06:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:06:50,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:06:50,587 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:06:50,588 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:06:50,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 09:06:50,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:06:50,793 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:50,902 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:06:50,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:06:50 BoogieIcfgContainer [2024-10-14 09:06:50,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:06:50,905 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:06:50,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:06:50,909 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:06:50,910 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:06:38" (3/4) ... [2024-10-14 09:06:50,911 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:06:50,912 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:06:50,913 INFO L158 Benchmark]: Toolchain (without parser) took 12937.48ms. Allocated memory was 159.4MB in the beginning and 287.3MB in the end (delta: 127.9MB). Free memory was 124.7MB in the beginning and 129.5MB in the end (delta: -4.8MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. [2024-10-14 09:06:50,913 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:06:50,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.70ms. Allocated memory is still 159.4MB. Free memory was 124.3MB in the beginning and 108.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 09:06:50,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.35ms. Allocated memory is still 159.4MB. Free memory was 108.6MB in the beginning and 105.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 09:06:50,917 INFO L158 Benchmark]: Boogie Preprocessor took 52.59ms. Allocated memory is still 159.4MB. Free memory was 105.5MB in the beginning and 101.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:06:50,917 INFO L158 Benchmark]: RCFGBuilder took 548.93ms. Allocated memory is still 159.4MB. Free memory was 101.3MB in the beginning and 105.3MB in the end (delta: -4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 09:06:50,917 INFO L158 Benchmark]: TraceAbstraction took 11965.54ms. Allocated memory was 159.4MB in the beginning and 287.3MB in the end (delta: 127.9MB). Free memory was 104.3MB in the beginning and 130.6MB in the end (delta: -26.2MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. [2024-10-14 09:06:50,918 INFO L158 Benchmark]: Witness Printer took 6.95ms. Allocated memory is still 287.3MB. Free memory was 130.6MB in the beginning and 129.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:06:50,919 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.14ms. Allocated memory is still 104.9MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.70ms. Allocated memory is still 159.4MB. Free memory was 124.3MB in the beginning and 108.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.35ms. Allocated memory is still 159.4MB. Free memory was 108.6MB in the beginning and 105.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.59ms. Allocated memory is still 159.4MB. Free memory was 105.5MB in the beginning and 101.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 548.93ms. Allocated memory is still 159.4MB. Free memory was 101.3MB in the beginning and 105.3MB in the end (delta: -4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11965.54ms. Allocated memory was 159.4MB in the beginning and 287.3MB in the end (delta: 127.9MB). Free memory was 104.3MB in the beginning and 130.6MB in the end (delta: -26.2MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. * Witness Printer took 6.95ms. Allocated memory is still 287.3MB. Free memory was 130.6MB in the beginning and 129.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryArithmeticDOUBLEoperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someUnaryFLOAToperation at line 131. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] unsigned long int var_1_24 = 2; [L41] unsigned long int var_1_26 = 1; [L42] double var_1_33 = 1.5; [L43] double var_1_35 = 50.5; [L44] double var_1_36 = 1.9; [L45] unsigned long int var_1_37 = 10000; [L46] unsigned char var_1_38 = 1; [L47] unsigned char var_1_39 = 0; [L48] double var_1_40 = 15.5; [L49] unsigned long int var_1_42 = 128; [L50] signed char var_1_43 = -1; [L51] signed long int last_1_var_1_9 = -50; [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L182] last_1_var_1_9 = var_1_9 [L192] RET updateLastVariables() [L193] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_ulong() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L146] var_1_6 = __VERIFIER_nondet_ulong() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L149] var_1_8 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L150] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L151] var_1_14 = __VERIFIER_nondet_ulong() [L152] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L152] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L154] var_1_15 = __VERIFIER_nondet_ulong() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L156] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L156] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L157] var_1_16 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L158] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L160] var_1_17 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L161] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L163] var_1_18 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L164] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L166] var_1_20 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L170] var_1_23 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L171] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L173] var_1_35 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L174] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L175] var_1_36 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L176] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L177] var_1_39 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L178] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L193] RET updateVariables() [L194] CALL step() [L55] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_0=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L56] COND FALSE !(stepLocal_0 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L59] var_1_21 = var_1_6 [L60] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L61] COND FALSE !((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L64] unsigned long int stepLocal_4 = 4256310412u - 128u; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_4=4256310284, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L65] COND FALSE !(var_1_4 >= stepLocal_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L68] signed long int stepLocal_3 = var_1_9; [L69] unsigned long int stepLocal_2 = (((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L70] EXPR var_1_21 ^ 4u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L70] unsigned long int stepLocal_1 = var_1_21 ^ 4u; [L71] COND FALSE !(var_1_9 <= stepLocal_2) [L80] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L82] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L89] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L91] signed long int stepLocal_5 = (var_1_22 / 2) / var_1_20; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, stepLocal_5=0, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L92] COND TRUE stepLocal_5 >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L93] COND TRUE \read(var_1_13) [L94] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L103] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L104] COND FALSE !(var_1_5 != var_1_21) [L111] var_1_26 = 16u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L113] COND TRUE \read(var_1_17) [L114] var_1_33 = (var_1_35 - var_1_36) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L116] COND FALSE !(var_1_35 >= var_1_8) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L121] COND TRUE var_1_16 < ((var_1_6 + 16u) * var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L122] COND FALSE !(var_1_17 && (var_1_35 < var_1_36)) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L130] COND TRUE (var_1_35 <= 64.5) && var_1_18 [L131] var_1_40 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L135] COND FALSE !(var_1_20 < var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L138] COND TRUE \read(var_1_17) [L139] var_1_43 = ((((((((-16) < 0 ) ? -(-16) : (-16)))) > (var_1_23)) ? (((((-16) < 0 ) ? -(-16) : (-16)))) : (var_1_23))) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=16, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=16, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L185] EXPR (var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=16, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=16, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L185-L186] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=16, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=16, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1426 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1414 mSDsluCounter, 2170 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1054 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1084 IncrementalHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 1116 mSDtfsCounter, 1084 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1021 GetRequests, 949 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=8, InterpolantAutomatonStates: 65, 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, 8 MinimizatonAttempts, 194 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1948 NumberOfCodeBlocks, 1948 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1610 ConstructedInterpolants, 5 QuantifiedInterpolants, 8739 SizeOfPredicates, 11 NumberOfNonLiveVariables, 755 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 10899/11040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 09:06:50,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.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 f8c7f093a0092c99d535dacf9ec847d585a162cf9e23f66317fd8ccac5a76f81 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:06:52,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:06:52,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:06:52,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:06:52,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:06:52,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:06:52,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:06:52,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:06:52,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:06:52,827 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:06:52,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:06:52,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:06:52,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:06:52,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:06:52,829 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:06:52,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:06:52,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:06:52,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:06:52,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:06:52,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:06:52,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:06:52,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:06:52,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:06:52,833 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:06:52,833 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:06:52,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:06:52,833 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:06:52,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:06:52,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:06:52,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:06:52,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:06:52,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:06:52,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:06:52,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:06:52,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:06:52,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:06:52,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:06:52,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:06:52,836 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:06:52,837 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:06:52,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:06:52,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:06:52,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:06:52,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:06:52,838 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:06:52,838 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 -> f8c7f093a0092c99d535dacf9ec847d585a162cf9e23f66317fd8ccac5a76f81 [2024-10-14 09:06:53,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:06:53,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:06:53,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:06:53,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:06:53,102 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:06:53,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-10-14 09:06:54,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:06:54,577 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:06:54,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-10-14 09:06:54,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12d2c105d/3c348ef626e64cf38fc783eadb2fc859/FLAGd50bedeab [2024-10-14 09:06:54,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12d2c105d/3c348ef626e64cf38fc783eadb2fc859 [2024-10-14 09:06:54,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:06:54,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:06:54,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:06:54,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:06:54,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:06:54,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:06:54" (1/1) ... [2024-10-14 09:06:54,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@546af87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:54, skipping insertion in model container [2024-10-14 09:06:54,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:06:54" (1/1) ... [2024-10-14 09:06:55,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:06:55,136 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i[919,932] [2024-10-14 09:06:55,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:06:55,221 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:06:55,231 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i[919,932] [2024-10-14 09:06:55,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:06:55,292 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:06:55,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55 WrapperNode [2024-10-14 09:06:55,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:06:55,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:06:55,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:06:55,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:06:55,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (1/1) ... [2024-10-14 09:06:55,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (1/1) ... [2024-10-14 09:06:55,343 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-14 09:06:55,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:06:55,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:06:55,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:06:55,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:06:55,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (1/1) ... [2024-10-14 09:06:55,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (1/1) ... [2024-10-14 09:06:55,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (1/1) ... [2024-10-14 09:06:55,373 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-10-14 09:06:55,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (1/1) ... [2024-10-14 09:06:55,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (1/1) ... [2024-10-14 09:06:55,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (1/1) ... [2024-10-14 09:06:55,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (1/1) ... [2024-10-14 09:06:55,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (1/1) ... [2024-10-14 09:06:55,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (1/1) ... [2024-10-14 09:06:55,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:06:55,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:06:55,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:06:55,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:06:55,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (1/1) ... [2024-10-14 09:06:55,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:06:55,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:06:55,445 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-10-14 09:06:55,447 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-10-14 09:06:55,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:06:55,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:06:55,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:06:55,477 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:06:55,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:06:55,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:06:55,555 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:06:55,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:06:56,087 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 09:06:56,088 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:06:56,131 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:06:56,131 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:06:56,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:06:56 BoogieIcfgContainer [2024-10-14 09:06:56,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:06:56,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:06:56,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:06:56,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:06:56,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:06:54" (1/3) ... [2024-10-14 09:06:56,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282c04f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:06:56, skipping insertion in model container [2024-10-14 09:06:56,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:06:55" (2/3) ... [2024-10-14 09:06:56,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282c04f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:06:56, skipping insertion in model container [2024-10-14 09:06:56,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:06:56" (3/3) ... [2024-10-14 09:06:56,138 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-10-14 09:06:56,150 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:06:56,151 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:06:56,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:06:56,216 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;@1397f5ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:06:56,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:06:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 09:06:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 09:06:56,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:56,235 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:56,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:56,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:56,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1907523825, now seen corresponding path program 1 times [2024-10-14 09:06:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:06:56,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242054005] [2024-10-14 09:06:56,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:56,259 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-10-14 09:06:56,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:06:56,262 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-10-14 09:06:56,263 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-10-14 09:06:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:56,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:06:56,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:06:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-14 09:06:56,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:06:56,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:06:56,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242054005] [2024-10-14 09:06:56,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242054005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:06:56,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:06:56,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:06:56,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694758535] [2024-10-14 09:06:56,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:06:56,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:06:56,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:06:56,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:06:56,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:06:56,681 INFO L87 Difference]: Start difference. First operand has 78 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 09:06:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:06:56,781 INFO L93 Difference]: Finished difference Result 153 states and 276 transitions. [2024-10-14 09:06:56,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:06:56,792 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2024-10-14 09:06:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:06:56,798 INFO L225 Difference]: With dead ends: 153 [2024-10-14 09:06:56,798 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 09:06:56,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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-10-14 09:06:56,803 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:06:56,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:06:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 09:06:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-14 09:06:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.48) internal successors, (74), 50 states have internal predecessors, (74), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 09:06:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 122 transitions. [2024-10-14 09:06:56,838 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 122 transitions. Word has length 157 [2024-10-14 09:06:56,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:06:56,839 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 122 transitions. [2024-10-14 09:06:56,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 09:06:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 122 transitions. [2024-10-14 09:06:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 09:06:56,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:56,842 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:56,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 09:06:57,043 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-10-14 09:06:57,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:57,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1096666037, now seen corresponding path program 1 times [2024-10-14 09:06:57,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:06:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222313118] [2024-10-14 09:06:57,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:57,046 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-10-14 09:06:57,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:06:57,048 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-10-14 09:06:57,048 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-10-14 09:06:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:57,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 09:06:57,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:06:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 09:06:57,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:06:57,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:06:57,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222313118] [2024-10-14 09:06:57,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222313118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:06:57,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:06:57,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:06:57,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697132610] [2024-10-14 09:06:57,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:06:57,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:06:57,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:06:57,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:06:57,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:06:57,800 INFO L87 Difference]: Start difference. First operand 76 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 09:06:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:06:58,401 INFO L93 Difference]: Finished difference Result 255 states and 413 transitions. [2024-10-14 09:06:58,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:06:58,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-10-14 09:06:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:06:58,415 INFO L225 Difference]: With dead ends: 255 [2024-10-14 09:06:58,415 INFO L226 Difference]: Without dead ends: 180 [2024-10-14 09:06:58,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:06:58,416 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 125 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:06:58,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 474 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 09:06:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-14 09:06:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 149. [2024-10-14 09:06:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.469387755102041) internal successors, (144), 98 states have internal predecessors, (144), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 09:06:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 240 transitions. [2024-10-14 09:06:58,447 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 240 transitions. Word has length 157 [2024-10-14 09:06:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:06:58,448 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 240 transitions. [2024-10-14 09:06:58,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 09:06:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 240 transitions. [2024-10-14 09:06:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 09:06:58,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:58,450 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:58,461 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-10-14 09:06:58,653 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-10-14 09:06:58,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:58,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1315520755, now seen corresponding path program 1 times [2024-10-14 09:06:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:06:58,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843755607] [2024-10-14 09:06:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:58,655 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-10-14 09:06:58,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:06:58,658 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-10-14 09:06:58,659 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-10-14 09:06:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:06:58,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 09:06:58,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:06:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 09:06:59,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:06:59,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:06:59,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843755607] [2024-10-14 09:06:59,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843755607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:06:59,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:06:59,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:06:59,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745538290] [2024-10-14 09:06:59,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:06:59,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:06:59,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:06:59,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:06:59,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:06:59,188 INFO L87 Difference]: Start difference. First operand 149 states and 240 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 09:06:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:06:59,508 INFO L93 Difference]: Finished difference Result 151 states and 241 transitions. [2024-10-14 09:06:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:06:59,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-10-14 09:06:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:06:59,517 INFO L225 Difference]: With dead ends: 151 [2024-10-14 09:06:59,517 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 09:06:59,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:06:59,519 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:06:59,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 172 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:06:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 09:06:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-14 09:06:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 09:06:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. [2024-10-14 09:06:59,546 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 119 transitions. Word has length 157 [2024-10-14 09:06:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:06:59,547 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 119 transitions. [2024-10-14 09:06:59,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 09:06:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 119 transitions. [2024-10-14 09:06:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 09:06:59,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:06:59,549 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:06:59,570 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 (4)] Forceful destruction successful, exit code 0 [2024-10-14 09:06:59,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:06:59,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:06:59,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:06:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash -676776909, now seen corresponding path program 1 times [2024-10-14 09:06:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:06:59,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786298588] [2024-10-14 09:06:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:06:59,751 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-10-14 09:06:59,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:06:59,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:06:59,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 09:07:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:00,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 09:07:00,032 INFO L278 TraceCheckSpWp]: Computing forward predicates...