./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.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 898d5ec73e5c3c04d61da6c8734a452d0bd7fbe525cd14933afc15d02bcc3c25 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:45:15,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:45:15,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:45:15,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:45:15,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:45:16,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:45:16,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:45:16,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:45:16,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:45:16,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:45:16,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:45:16,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:45:16,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:45:16,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:45:16,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:45:16,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:45:16,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:45:16,021 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:45:16,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:45:16,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:45:16,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:45:16,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:45:16,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:45:16,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:45:16,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:45:16,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:45:16,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:45:16,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:45:16,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:45:16,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:45:16,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:45:16,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:45:16,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:45:16,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:45:16,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:45:16,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:45:16,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:45:16,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:45:16,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:45:16,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:45:16,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:45:16,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:45:16,027 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 -> 898d5ec73e5c3c04d61da6c8734a452d0bd7fbe525cd14933afc15d02bcc3c25 [2024-11-08 21:45:16,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:45:16,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:45:16,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:45:16,238 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:45:16,239 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:45:16,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i [2024-11-08 21:45:17,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:45:17,603 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:45:17,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i [2024-11-08 21:45:17,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c523dbfa/38ca59bdaa944bd88d8a5cbdef2ff94d/FLAGf8a8ac36c [2024-11-08 21:45:17,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c523dbfa/38ca59bdaa944bd88d8a5cbdef2ff94d [2024-11-08 21:45:17,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:45:17,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:45:17,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:45:17,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:45:17,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:45:17,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:45:17" (1/1) ... [2024-11-08 21:45:17,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c7f3543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:17, skipping insertion in model container [2024-11-08 21:45:17,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:45:17" (1/1) ... [2024-11-08 21:45:18,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:45:18,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i[919,932] [2024-11-08 21:45:18,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:45:18,207 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:45:18,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i[919,932] [2024-11-08 21:45:18,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:45:18,255 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:45:18,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18 WrapperNode [2024-11-08 21:45:18,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:45:18,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:45:18,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:45:18,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:45:18,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (1/1) ... [2024-11-08 21:45:18,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (1/1) ... [2024-11-08 21:45:18,304 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-11-08 21:45:18,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:45:18,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:45:18,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:45:18,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:45:18,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (1/1) ... [2024-11-08 21:45:18,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (1/1) ... [2024-11-08 21:45:18,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (1/1) ... [2024-11-08 21:45:18,336 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:45:18,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (1/1) ... [2024-11-08 21:45:18,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (1/1) ... [2024-11-08 21:45:18,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (1/1) ... [2024-11-08 21:45:18,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (1/1) ... [2024-11-08 21:45:18,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (1/1) ... [2024-11-08 21:45:18,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (1/1) ... [2024-11-08 21:45:18,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:45:18,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:45:18,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:45:18,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:45:18,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (1/1) ... [2024-11-08 21:45:18,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:45:18,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:45:18,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:45:18,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:45:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:45:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:45:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:45:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:45:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:45:18,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:45:18,493 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:45:18,494 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:45:18,785 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-08 21:45:18,786 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:45:18,800 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:45:18,801 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:45:18,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:45:18 BoogieIcfgContainer [2024-11-08 21:45:18,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:45:18,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:45:18,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:45:18,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:45:18,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:45:17" (1/3) ... [2024-11-08 21:45:18,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bce351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:45:18, skipping insertion in model container [2024-11-08 21:45:18,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:18" (2/3) ... [2024-11-08 21:45:18,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bce351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:45:18, skipping insertion in model container [2024-11-08 21:45:18,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:45:18" (3/3) ... [2024-11-08 21:45:18,809 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i [2024-11-08 21:45:18,822 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:45:18,822 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:45:18,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:45:18,877 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;@37ed6aa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:45:18,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:45:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:45:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 21:45:18,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:45:18,895 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:18,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:45:18,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:45:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1239382552, now seen corresponding path program 1 times [2024-11-08 21:45:18,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:45:18,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001425186] [2024-11-08 21:45:18,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:18,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:45:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:45:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:45:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 21:45:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:45:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:45:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 21:45:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:45:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:45:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:45:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:45:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:45:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:45:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:45:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:45:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:45:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:45:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:45:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:45:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:45:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:45:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:45:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:45:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:45:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:45:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:45:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:45:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:45:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:45:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:45:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:45:19,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:45:19,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001425186] [2024-11-08 21:45:19,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001425186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:45:19,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:45:19,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:45:19,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252939490] [2024-11-08 21:45:19,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:45:19,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:45:19,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:45:19,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:45:19,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:45:19,401 INFO L87 Difference]: Start difference. First operand has 98 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:45:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:45:19,432 INFO L93 Difference]: Finished difference Result 185 states and 327 transitions. [2024-11-08 21:45:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:45:19,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2024-11-08 21:45:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:45:19,442 INFO L225 Difference]: With dead ends: 185 [2024-11-08 21:45:19,442 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 21:45:19,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:45:19,448 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:45:19,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:45:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 21:45:19,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 21:45:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:45:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2024-11-08 21:45:19,492 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 190 [2024-11-08 21:45:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:45:19,494 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2024-11-08 21:45:19,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:45:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2024-11-08 21:45:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 21:45:19,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:45:19,502 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:19,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:45:19,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:45:19,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:45:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash -796019874, now seen corresponding path program 1 times [2024-11-08 21:45:19,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:45:19,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768699286] [2024-11-08 21:45:19,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:45:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:45:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:45:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 21:45:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:45:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:45:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 21:45:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:45:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:45:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:45:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:45:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:45:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:45:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:45:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:45:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:45:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:45:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:45:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:45:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:45:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:45:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:45:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:45:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:45:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:45:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:45:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:45:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:45:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:45:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:45:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:45:19,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:45:19,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768699286] [2024-11-08 21:45:19,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768699286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:45:19,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:45:19,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:45:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321347991] [2024-11-08 21:45:19,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:45:19,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:45:19,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:45:19,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:45:19,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:45:19,797 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:45:19,868 INFO L93 Difference]: Finished difference Result 227 states and 354 transitions. [2024-11-08 21:45:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:45:19,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-08 21:45:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:45:19,874 INFO L225 Difference]: With dead ends: 227 [2024-11-08 21:45:19,874 INFO L226 Difference]: Without dead ends: 140 [2024-11-08 21:45:19,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:45:19,876 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 71 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:45:19,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 264 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:45:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-08 21:45:19,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2024-11-08 21:45:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 97 states have internal predecessors, (133), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 21:45:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 209 transitions. [2024-11-08 21:45:19,903 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 209 transitions. Word has length 190 [2024-11-08 21:45:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:45:19,904 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 209 transitions. [2024-11-08 21:45:19,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 209 transitions. [2024-11-08 21:45:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 21:45:19,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:45:19,907 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:19,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:45:19,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:45:19,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:45:19,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1693509088, now seen corresponding path program 1 times [2024-11-08 21:45:19,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:45:19,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181096139] [2024-11-08 21:45:19,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:19,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:45:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:45:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:45:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 21:45:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:45:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:45:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 21:45:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:45:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:45:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:45:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:45:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:45:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:45:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:45:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:45:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:45:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:45:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:45:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:45:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:45:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:45:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:45:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:45:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:45:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:45:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:45:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:45:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:45:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:45:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:45:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:45:20,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:45:20,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181096139] [2024-11-08 21:45:20,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181096139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:45:20,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:45:20,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:45:20,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999653791] [2024-11-08 21:45:20,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:45:20,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:45:20,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:45:20,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:45:20,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:45:20,144 INFO L87 Difference]: Start difference. First operand 137 states and 209 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:45:20,205 INFO L93 Difference]: Finished difference Result 278 states and 420 transitions. [2024-11-08 21:45:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:45:20,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-08 21:45:20,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:45:20,208 INFO L225 Difference]: With dead ends: 278 [2024-11-08 21:45:20,208 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 21:45:20,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:45:20,210 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 59 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:45:20,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 286 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:45:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 21:45:20,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 117. [2024-11-08 21:45:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:45:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2024-11-08 21:45:20,225 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 175 transitions. Word has length 190 [2024-11-08 21:45:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:45:20,226 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 175 transitions. [2024-11-08 21:45:20,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 175 transitions. [2024-11-08 21:45:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 21:45:20,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:45:20,228 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:20,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:45:20,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:45:20,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:45:20,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1921399838, now seen corresponding path program 1 times [2024-11-08 21:45:20,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:45:20,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277133919] [2024-11-08 21:45:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:20,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:45:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:45:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:45:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 21:45:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:45:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:45:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 21:45:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:45:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:45:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:45:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:45:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:45:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:45:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:45:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:45:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:45:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:45:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:45:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:45:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:45:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:45:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:45:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:45:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:45:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:45:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:45:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:45:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:45:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:45:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:45:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:45:20,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:45:20,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277133919] [2024-11-08 21:45:20,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277133919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:45:20,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:45:20,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:45:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079979175] [2024-11-08 21:45:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:45:20,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:45:20,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:45:20,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:45:20,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:45:20,413 INFO L87 Difference]: Start difference. First operand 117 states and 175 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:45:20,538 INFO L93 Difference]: Finished difference Result 291 states and 426 transitions. [2024-11-08 21:45:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:45:20,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-08 21:45:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:45:20,541 INFO L225 Difference]: With dead ends: 291 [2024-11-08 21:45:20,541 INFO L226 Difference]: Without dead ends: 177 [2024-11-08 21:45:20,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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-11-08 21:45:20,543 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 100 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:45:20,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 396 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:45:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-08 21:45:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 119. [2024-11-08 21:45:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:45:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2024-11-08 21:45:20,556 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 190 [2024-11-08 21:45:20,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:45:20,557 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2024-11-08 21:45:20,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2024-11-08 21:45:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 21:45:20,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:45:20,559 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:20,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:45:20,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:45:20,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:45:20,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1564220832, now seen corresponding path program 1 times [2024-11-08 21:45:20,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:45:20,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509256364] [2024-11-08 21:45:20,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:45:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:45:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:45:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 21:45:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:45:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:45:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 21:45:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:45:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:45:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:45:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:45:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:45:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:45:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:45:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:45:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:45:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:45:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:45:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:45:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:45:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:45:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:45:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:45:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:45:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:45:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:45:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:45:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:45:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:45:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:45:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:45:20,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:45:20,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509256364] [2024-11-08 21:45:20,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509256364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:45:20,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:45:20,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:45:20,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354022649] [2024-11-08 21:45:20,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:45:20,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:45:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:45:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:45:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:45:20,822 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:45:20,856 INFO L93 Difference]: Finished difference Result 235 states and 351 transitions. [2024-11-08 21:45:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:45:20,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-11-08 21:45:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:45:20,858 INFO L225 Difference]: With dead ends: 235 [2024-11-08 21:45:20,858 INFO L226 Difference]: Without dead ends: 119 [2024-11-08 21:45:20,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:45:20,859 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:45:20,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 119 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:45:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-08 21:45:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-08 21:45:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:45:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2024-11-08 21:45:20,877 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 190 [2024-11-08 21:45:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:45:20,877 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2024-11-08 21:45:20,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2024-11-08 21:45:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:45:20,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:45:20,878 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:20,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:45:20,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:45:20,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:45:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash -451604180, now seen corresponding path program 1 times [2024-11-08 21:45:20,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:45:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106044775] [2024-11-08 21:45:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:45:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:20,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:45:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:45:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 21:45:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:45:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:45:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 21:45:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:45:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:45:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:45:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:45:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:45:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:45:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:45:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:45:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:45:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:45:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:45:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:45:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:45:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:45:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:45:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:45:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:45:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:45:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:45:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:45:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:45:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:45:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:45:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:45:21,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:45:21,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106044775] [2024-11-08 21:45:21,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106044775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:45:21,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:45:21,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:45:21,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623039305] [2024-11-08 21:45:21,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:45:21,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:45:21,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:45:21,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:45:21,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:45:21,066 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:45:21,104 INFO L93 Difference]: Finished difference Result 318 states and 471 transitions. [2024-11-08 21:45:21,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:45:21,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-08 21:45:21,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:45:21,106 INFO L225 Difference]: With dead ends: 318 [2024-11-08 21:45:21,106 INFO L226 Difference]: Without dead ends: 202 [2024-11-08 21:45:21,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:45:21,108 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 48 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:45:21,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 259 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:45:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-08 21:45:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2024-11-08 21:45:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 131 states have (on average 1.2900763358778626) internal successors, (169), 131 states have internal predecessors, (169), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 21:45:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2024-11-08 21:45:21,130 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 191 [2024-11-08 21:45:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:45:21,130 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2024-11-08 21:45:21,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2024-11-08 21:45:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:45:21,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:45:21,131 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:21,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:45:21,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:45:21,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:45:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1396126252, now seen corresponding path program 1 times [2024-11-08 21:45:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:45:21,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73924801] [2024-11-08 21:45:21,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:21,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:45:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:45:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:45:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 21:45:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:45:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:45:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 21:45:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:45:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:45:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:45:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:45:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:45:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:45:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:45:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:45:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:45:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:45:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:45:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:45:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:45:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:45:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:45:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:45:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:45:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:45:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:45:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:45:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:45:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:45:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:45:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:45:21,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:45:21,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73924801] [2024-11-08 21:45:21,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73924801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:45:21,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:45:21,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:45:21,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742376287] [2024-11-08 21:45:21,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:45:21,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:45:21,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:45:21,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:45:21,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:45:21,300 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:45:21,343 INFO L93 Difference]: Finished difference Result 400 states and 590 transitions. [2024-11-08 21:45:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:45:21,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-08 21:45:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:45:21,346 INFO L225 Difference]: With dead ends: 400 [2024-11-08 21:45:21,346 INFO L226 Difference]: Without dead ends: 284 [2024-11-08 21:45:21,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:45:21,347 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 128 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:45:21,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 251 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:45:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-08 21:45:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2024-11-08 21:45:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 180 states have (on average 1.2666666666666666) internal successors, (228), 180 states have internal predecessors, (228), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-08 21:45:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 402 transitions. [2024-11-08 21:45:21,367 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 402 transitions. Word has length 191 [2024-11-08 21:45:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:45:21,370 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 402 transitions. [2024-11-08 21:45:21,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:21,370 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 402 transitions. [2024-11-08 21:45:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:45:21,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:45:21,372 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:21,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 21:45:21,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:45:21,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:45:21,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1696467408, now seen corresponding path program 1 times [2024-11-08 21:45:21,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:45:21,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910878550] [2024-11-08 21:45:21,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:21,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:45:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:45:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:45:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 21:45:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:45:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 21:45:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 21:45:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 21:45:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:45:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:45:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:45:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:45:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:45:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:45:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:45:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:45:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:45:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:45:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:45:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:45:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:45:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 21:45:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:45:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 21:45:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:45:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 21:45:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:45:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 21:45:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:45:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 21:45:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:45:21,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:45:21,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910878550] [2024-11-08 21:45:21,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910878550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:45:21,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:45:21,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:45:21,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950398118] [2024-11-08 21:45:21,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:45:21,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:45:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:45:21,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:45:21,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:45:21,551 INFO L87 Difference]: Start difference. First operand 274 states and 402 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:45:21,641 INFO L93 Difference]: Finished difference Result 472 states and 692 transitions. [2024-11-08 21:45:21,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:45:21,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-08 21:45:21,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:45:21,644 INFO L225 Difference]: With dead ends: 472 [2024-11-08 21:45:21,644 INFO L226 Difference]: Without dead ends: 276 [2024-11-08 21:45:21,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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-11-08 21:45:21,645 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 54 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:45:21,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 381 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:45:21,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-08 21:45:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2024-11-08 21:45:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 180 states have (on average 1.261111111111111) internal successors, (227), 180 states have internal predecessors, (227), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-08 21:45:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 401 transitions. [2024-11-08 21:45:21,670 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 401 transitions. Word has length 191 [2024-11-08 21:45:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:45:21,671 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 401 transitions. [2024-11-08 21:45:21,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 401 transitions. [2024-11-08 21:45:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:45:21,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:45:21,673 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:21,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 21:45:21,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:45:21,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:45:21,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1789153262, now seen corresponding path program 1 times [2024-11-08 21:45:21,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:45:21,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46034604] [2024-11-08 21:45:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:21,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:45:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:45:21,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34833375] [2024-11-08 21:45:21,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:21,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:45:21,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:45:21,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:45:21,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 21:45:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:45:22,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:45:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:45:22,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:45:22,142 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:45:22,143 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:45:22,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 21:45:22,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:45:22,348 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:22,447 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:45:22,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:45:22 BoogieIcfgContainer [2024-11-08 21:45:22,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:45:22,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:45:22,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:45:22,449 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:45:22,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:45:18" (3/4) ... [2024-11-08 21:45:22,451 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:45:22,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:45:22,452 INFO L158 Benchmark]: Toolchain (without parser) took 4469.04ms. Allocated memory was 203.4MB in the beginning and 260.0MB in the end (delta: 56.6MB). Free memory was 172.8MB in the beginning and 86.1MB in the end (delta: 86.7MB). Peak memory consumption was 142.5MB. Max. memory is 16.1GB. [2024-11-08 21:45:22,453 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 136.3MB. Free memory was 99.9MB in the beginning and 99.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:45:22,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.76ms. Allocated memory is still 203.4MB. Free memory was 172.6MB in the beginning and 159.5MB in the end (delta: 13.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-11-08 21:45:22,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.62ms. Allocated memory is still 203.4MB. Free memory was 159.5MB in the beginning and 155.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:45:22,453 INFO L158 Benchmark]: Boogie Preprocessor took 59.14ms. Allocated memory is still 203.4MB. Free memory was 155.3MB in the beginning and 149.9MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:45:22,453 INFO L158 Benchmark]: RCFGBuilder took 436.58ms. Allocated memory is still 203.4MB. Free memory was 149.9MB in the beginning and 123.8MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 21:45:22,454 INFO L158 Benchmark]: TraceAbstraction took 3646.12ms. Allocated memory was 203.4MB in the beginning and 260.0MB in the end (delta: 56.6MB). Free memory was 123.5MB in the beginning and 86.1MB in the end (delta: 37.5MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2024-11-08 21:45:22,454 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 260.0MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:45:22,455 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.09ms. Allocated memory is still 136.3MB. Free memory was 99.9MB in the beginning and 99.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.76ms. Allocated memory is still 203.4MB. Free memory was 172.6MB in the beginning and 159.5MB in the end (delta: 13.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.62ms. Allocated memory is still 203.4MB. Free memory was 159.5MB in the beginning and 155.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.14ms. Allocated memory is still 203.4MB. Free memory was 155.3MB in the beginning and 149.9MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 436.58ms. Allocated memory is still 203.4MB. Free memory was 149.9MB in the beginning and 123.8MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3646.12ms. Allocated memory was 203.4MB in the beginning and 260.0MB in the end (delta: 56.6MB). Free memory was 123.5MB in the beginning and 86.1MB in the end (delta: 37.5MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 260.0MB. Free memory is still 86.1MB. 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 175, overapproximation of shiftRight at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 122, overapproximation of someUnaryDOUBLEoperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 175. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.25; [L23] signed long int var_1_3 = -25; [L24] signed long int var_1_4 = -128; [L25] double var_1_6 = 2.75; [L26] double var_1_7 = 24.5; [L27] double var_1_8 = 199.5; [L28] float var_1_9 = 32.8; [L29] unsigned char var_1_10 = 1; [L30] float var_1_11 = 15.4; [L31] float var_1_12 = 0.0; [L32] unsigned long int var_1_13 = 2; [L33] float var_1_16 = 127.6; [L34] signed long int var_1_17 = 128; [L35] unsigned char var_1_19 = 10; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 64; [L38] double var_1_22 = 15.95; [L39] unsigned long int var_1_23 = 4127848294; [L40] unsigned long int var_1_24 = 256; [L41] unsigned char var_1_27 = 1; [L42] unsigned char var_1_29 = 1; [L43] unsigned char var_1_30 = 0; [L44] unsigned char var_1_31 = 1; [L45] double var_1_32 = 32.7; [L46] unsigned char var_1_34 = 1; [L47] unsigned long int var_1_35 = 1000; [L48] signed char var_1_39 = -32; [L49] signed char var_1_40 = 16; [L50] signed char var_1_41 = 4; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_43 = 0; [L53] float var_1_44 = 99999999999.2; VAL [isInitial=0, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=-25, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L179] isInitial = 1 [L180] FCALL initially() [L181] COND TRUE 1 [L182] FCALL updateLastVariables() [L183] CALL updateVariables() [L126] var_1_3 = __VERIFIER_nondet_long() [L127] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L127] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L128] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L128] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L129] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L129] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L130] var_1_4 = __VERIFIER_nondet_long() [L131] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L131] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L132] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L132] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L133] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L133] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L134] var_1_6 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L135] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L136] var_1_7 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L137] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L138] var_1_8 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L139] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L140] var_1_10 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L141] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L142] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L142] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L143] var_1_11 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L144] RET assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L145] var_1_12 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L146] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L147] var_1_20 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L148] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L149] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L149] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L150] var_1_21 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L151] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L152] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L152] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L153] var_1_23 = __VERIFIER_nondet_ulong() [L154] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L154] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L155] CALL assume_abort_if_not(var_1_23 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L155] RET assume_abort_if_not(var_1_23 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L156] var_1_29 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L157] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L158] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L158] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L159] var_1_30 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L160] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L161] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L161] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L162] var_1_40 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_40 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L163] RET assume_abort_if_not(var_1_40 >= -63) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L164] CALL assume_abort_if_not(var_1_40 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L164] RET assume_abort_if_not(var_1_40 <= 63) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L165] var_1_41 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L166] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L167] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L167] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L168] var_1_43 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L169] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L170] CALL assume_abort_if_not(var_1_43 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L170] RET assume_abort_if_not(var_1_43 <= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L183] RET updateVariables() [L184] CALL step() [L57] COND TRUE var_1_12 <= (var_1_7 * 5.8f) [L58] var_1_16 = ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L62] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L65] var_1_31 = var_1_30 [L66] var_1_34 = (! (var_1_10 && var_1_30)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L67] EXPR var_1_19 >> var_1_19 VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L67] COND FALSE !(((var_1_19 >> var_1_19) % -10) >= var_1_4) [L72] COND TRUE var_1_10 || var_1_20 [L73] var_1_19 = ((((var_1_21) > (32)) ? (var_1_21) : (32))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L75] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L80] COND TRUE var_1_13 <= 32u VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L81] COND TRUE var_1_13 < var_1_21 [L82] var_1_27 = (var_1_10 || (var_1_10 || var_1_29)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L91] signed long int stepLocal_0 = (var_1_3 % var_1_4) * var_1_19; VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_1=21/4, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L92] COND TRUE var_1_19 > stepLocal_0 [L93] var_1_1 = (var_1_6 - (var_1_7 + var_1_8)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L97] COND TRUE ! var_1_10 [L98] var_1_13 = (50u + var_1_19) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L102] COND TRUE var_1_21 <= var_1_19 [L103] var_1_32 = (((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) < 0 ) ? -((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) : ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L105] COND FALSE !(var_1_8 < (var_1_22 / var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L110] COND TRUE -32 >= var_1_13 [L111] var_1_39 = (((((5 + var_1_40)) > (var_1_41)) ? ((5 + var_1_40)) : (var_1_41))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L113] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L116] COND FALSE !(var_1_10 || (var_1_19 == var_1_13)) [L119] var_1_9 = ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=4] [L121] COND TRUE var_1_6 < ((((var_1_8) < (var_1_7)) ? (var_1_8) : (var_1_7))) [L122] var_1_44 = (var_1_8 + var_1_8) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=4] [L184] RET step() [L185] CALL, EXPR property() [L175] EXPR (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=4] [L175-L176] return (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) ; [L185] RET, EXPR property() [L185] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=4] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=82, var_1_16=2, var_1_17=128, var_1_19=32, var_1_20=1, var_1_21=3, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=3, var_1_34=1, var_1_35=1000, var_1_39=0, var_1_3=3, var_1_40=-5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 545 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 545 mSDsluCounter, 2096 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 927 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1169 mSDtfsCounter, 267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=7, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 108 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1905 NumberOfCodeBlocks, 1905 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1515 ConstructedInterpolants, 0 QuantifiedInterpolants, 2369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 12992/12992 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 21:45:22,478 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.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 898d5ec73e5c3c04d61da6c8734a452d0bd7fbe525cd14933afc15d02bcc3c25 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:45:24,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:45:24,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:45:24,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:45:24,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:45:24,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:45:24,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:45:24,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:45:24,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:45:24,271 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:45:24,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:45:24,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:45:24,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:45:24,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:45:24,272 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:45:24,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:45:24,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:45:24,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:45:24,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:45:24,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:45:24,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:45:24,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:45:24,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:45:24,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:45:24,277 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:45:24,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:45:24,277 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:45:24,277 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:45:24,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:45:24,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:45:24,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:45:24,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:45:24,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:45:24,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:45:24,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:45:24,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:45:24,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:45:24,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:45:24,279 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:45:24,279 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:45:24,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:45:24,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:45:24,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:45:24,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:45:24,281 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 -> 898d5ec73e5c3c04d61da6c8734a452d0bd7fbe525cd14933afc15d02bcc3c25 [2024-11-08 21:45:24,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:45:24,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:45:24,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:45:24,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:45:24,530 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:45:24,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i [2024-11-08 21:45:25,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:45:25,895 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:45:25,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i [2024-11-08 21:45:25,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51bc3122/f8186e6e5ad2478dad70b0524516778b/FLAG677be130a [2024-11-08 21:45:25,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51bc3122/f8186e6e5ad2478dad70b0524516778b [2024-11-08 21:45:25,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:45:25,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:45:25,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:45:25,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:45:25,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:45:25,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:45:25" (1/1) ... [2024-11-08 21:45:25,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a3d859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:25, skipping insertion in model container [2024-11-08 21:45:25,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:45:25" (1/1) ... [2024-11-08 21:45:25,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:45:26,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i[919,932] [2024-11-08 21:45:26,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:45:26,194 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:45:26,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i[919,932] [2024-11-08 21:45:26,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:45:26,271 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:45:26,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26 WrapperNode [2024-11-08 21:45:26,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:45:26,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:45:26,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:45:26,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:45:26,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (1/1) ... [2024-11-08 21:45:26,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (1/1) ... [2024-11-08 21:45:26,331 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-08 21:45:26,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:45:26,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:45:26,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:45:26,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:45:26,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (1/1) ... [2024-11-08 21:45:26,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (1/1) ... [2024-11-08 21:45:26,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (1/1) ... [2024-11-08 21:45:26,370 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:45:26,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (1/1) ... [2024-11-08 21:45:26,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (1/1) ... [2024-11-08 21:45:26,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (1/1) ... [2024-11-08 21:45:26,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (1/1) ... [2024-11-08 21:45:26,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (1/1) ... [2024-11-08 21:45:26,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (1/1) ... [2024-11-08 21:45:26,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:45:26,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:45:26,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:45:26,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:45:26,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (1/1) ... [2024-11-08 21:45:26,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:45:26,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:45:26,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:45:26,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:45:26,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:45:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:45:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:45:26,467 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:45:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:45:26,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:45:26,532 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:45:26,533 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:45:51,839 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 21:45:51,839 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:45:51,850 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:45:51,850 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:45:51,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:45:51 BoogieIcfgContainer [2024-11-08 21:45:51,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:45:51,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:45:51,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:45:51,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:45:51,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:45:25" (1/3) ... [2024-11-08 21:45:51,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a78894a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:45:51, skipping insertion in model container [2024-11-08 21:45:51,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:45:26" (2/3) ... [2024-11-08 21:45:51,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a78894a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:45:51, skipping insertion in model container [2024-11-08 21:45:51,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:45:51" (3/3) ... [2024-11-08 21:45:51,857 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-62.i [2024-11-08 21:45:51,868 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:45:51,868 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:45:51,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:45:51,924 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;@49819e9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:45:51,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:45:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:45:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 21:45:51,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:45:51,943 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:51,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:45:51,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:45:51,949 INFO L85 PathProgramCache]: Analyzing trace with hash -391179290, now seen corresponding path program 1 times [2024-11-08 21:45:51,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:45:51,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046267572] [2024-11-08 21:45:51,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:51,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:45:51,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:45:51,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:45:51,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 21:45:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:53,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:45:53,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:45:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-08 21:45:53,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:45:53,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:45:53,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046267572] [2024-11-08 21:45:53,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046267572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:45:53,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:45:53,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:45:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651305006] [2024-11-08 21:45:53,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:45:53,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:45:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:45:53,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:45:53,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:45:53,463 INFO L87 Difference]: Start difference. First operand has 85 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:45:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:45:53,490 INFO L93 Difference]: Finished difference Result 163 states and 293 transitions. [2024-11-08 21:45:53,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:45:53,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-11-08 21:45:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:45:53,498 INFO L225 Difference]: With dead ends: 163 [2024-11-08 21:45:53,499 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 21:45:53,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:45:53,504 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:45:53,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:45:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 21:45:53,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 21:45:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:45:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 128 transitions. [2024-11-08 21:45:53,539 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 128 transitions. Word has length 187 [2024-11-08 21:45:53,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:45:53,540 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 128 transitions. [2024-11-08 21:45:53,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:45:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 128 transitions. [2024-11-08 21:45:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 21:45:53,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:45:53,544 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:53,585 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-11-08 21:45:53,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:45:53,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:45:53,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:45:53,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1062129760, now seen corresponding path program 1 times [2024-11-08 21:45:53,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:45:53,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510104662] [2024-11-08 21:45:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:53,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:45:53,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:45:53,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:45:53,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 21:45:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:55,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:45:55,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:45:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:45:55,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:45:55,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:45:55,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510104662] [2024-11-08 21:45:55,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510104662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:45:55,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:45:55,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:45:55,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423602030] [2024-11-08 21:45:55,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:45:55,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:45:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:45:55,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:45:55,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:45:55,344 INFO L87 Difference]: Start difference. First operand 81 states and 128 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:59,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:03,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:07,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:11,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:15,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:46:15,900 INFO L93 Difference]: Finished difference Result 203 states and 321 transitions. [2024-11-08 21:46:15,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:46:15,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-11-08 21:46:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:46:15,903 INFO L225 Difference]: With dead ends: 203 [2024-11-08 21:46:15,903 INFO L226 Difference]: Without dead ends: 125 [2024-11-08 21:46:15,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:46:15,906 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 58 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:46:15,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 266 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 4 Unknown, 0 Unchecked, 20.5s Time] [2024-11-08 21:46:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-08 21:46:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2024-11-08 21:46:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 82 states have internal predecessors, (115), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 21:46:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 191 transitions. [2024-11-08 21:46:15,926 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 191 transitions. Word has length 187 [2024-11-08 21:46:15,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:46:15,927 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 191 transitions. [2024-11-08 21:46:15,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:46:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 191 transitions. [2024-11-08 21:46:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 21:46:15,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:46:15,930 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:46:15,974 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 (3)] Forceful destruction successful, exit code 0 [2024-11-08 21:46:16,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:46:16,131 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:46:16,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:46:16,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1457830174, now seen corresponding path program 1 times [2024-11-08 21:46:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:46:16,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065891047] [2024-11-08 21:46:16,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:46:16,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:46:16,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:46:16,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:46:16,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 21:46:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:46:17,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:46:17,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:46:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:46:18,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:46:18,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:46:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065891047] [2024-11-08 21:46:18,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065891047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:46:18,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:46:18,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:46:18,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857164763] [2024-11-08 21:46:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:46:18,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:46:18,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:46:18,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:46:18,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:46:18,070 INFO L87 Difference]: Start difference. First operand 122 states and 191 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:46:22,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:26,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:30,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:34,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:38,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:38,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:46:38,778 INFO L93 Difference]: Finished difference Result 248 states and 384 transitions. [2024-11-08 21:46:38,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:46:38,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-11-08 21:46:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:46:38,934 INFO L225 Difference]: With dead ends: 248 [2024-11-08 21:46:38,934 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 21:46:38,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:46:38,938 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 56 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:46:38,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 251 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 4 Unknown, 0 Unchecked, 20.7s Time] [2024-11-08 21:46:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 21:46:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2024-11-08 21:46:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:46:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2024-11-08 21:46:38,951 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 187 [2024-11-08 21:46:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:46:38,951 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2024-11-08 21:46:38,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:46:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2024-11-08 21:46:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 21:46:38,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:46:38,953 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:46:38,998 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-11-08 21:46:39,154 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-11-08 21:46:39,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:46:39,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:46:39,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2019488672, now seen corresponding path program 1 times [2024-11-08 21:46:39,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:46:39,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635408743] [2024-11-08 21:46:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:46:39,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:46:39,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:46:39,159 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-11-08 21:46:39,159 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-11-08 21:46:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:46:40,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:46:40,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:46:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:46:47,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:46:47,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:46:47,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635408743] [2024-11-08 21:46:47,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635408743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:46:47,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:46:47,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:46:47,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582675907] [2024-11-08 21:46:47,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:46:47,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:46:47,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:46:47,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:46:47,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:46:47,409 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:46:50,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:53,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:58,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:46:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:46:58,714 INFO L93 Difference]: Finished difference Result 279 states and 426 transitions. [2024-11-08 21:46:58,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:46:58,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-11-08 21:46:58,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:46:58,717 INFO L225 Difference]: With dead ends: 279 [2024-11-08 21:46:58,717 INFO L226 Difference]: Without dead ends: 180 [2024-11-08 21:46:58,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:46:58,719 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:46:58,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 237 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 11.3s Time] [2024-11-08 21:46:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-08 21:46:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2024-11-08 21:46:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 109 states have (on average 1.3211009174311927) internal successors, (144), 109 states have internal predecessors, (144), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 21:46:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 260 transitions. [2024-11-08 21:46:58,748 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 260 transitions. Word has length 187 [2024-11-08 21:46:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:46:58,749 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 260 transitions. [2024-11-08 21:46:58,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:46:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 260 transitions. [2024-11-08 21:46:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 21:46:58,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:46:58,751 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:46:58,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 21:46:58,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:46:58,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:46:58,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:46:58,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1582360542, now seen corresponding path program 1 times [2024-11-08 21:46:58,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:46:58,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732264972] [2024-11-08 21:46:58,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:46:58,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:46:58,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:46:58,954 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:46:58,955 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 (6)] Waiting until timeout for monitored process [2024-11-08 21:47:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:01,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 21:47:01,338 INFO L278 TraceCheckSpWp]: Computing forward predicates...