./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.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 e111ddb7b29b83b3c4c599c467dcaa70af487d74dbca60ec39ae91f7f9b2341e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:28:58,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:28:58,238 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:28:58,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:28:58,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:28:58,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:28:58,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:28:58,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:28:58,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:28:58,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:28:58,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:28:58,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:28:58,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:28:58,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:28:58,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:28:58,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:28:58,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:28:58,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:28:58,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:28:58,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:28:58,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:28:58,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:28:58,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:28:58,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:28:58,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:28:58,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:28:58,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:28:58,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:28:58,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:28:58,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:28:58,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:28:58,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:28:58,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:28:58,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:28:58,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:28:58,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:28:58,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:28:58,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:28:58,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:28:58,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:28:58,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:28:58,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:28:58,301 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 -> e111ddb7b29b83b3c4c599c467dcaa70af487d74dbca60ec39ae91f7f9b2341e [2024-11-20 05:28:58,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:28:58,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:28:58,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:28:58,580 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:28:58,580 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:28:58,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i [2024-11-20 05:29:00,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:29:00,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:29:00,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i [2024-11-20 05:29:00,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4c4a308f/b329acb07bff4a409d4a97934e0fb85c/FLAG7fd07ff6b [2024-11-20 05:29:00,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4c4a308f/b329acb07bff4a409d4a97934e0fb85c [2024-11-20 05:29:00,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:29:00,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:29:00,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:29:00,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:29:00,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:29:00,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:29:00" (1/1) ... [2024-11-20 05:29:00,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ddff112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:00, skipping insertion in model container [2024-11-20 05:29:00,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:29:00" (1/1) ... [2024-11-20 05:29:00,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:29:00,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i[919,932] [2024-11-20 05:29:01,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:29:01,038 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:29:01,049 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i[919,932] [2024-11-20 05:29:01,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:29:01,111 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:29:01,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01 WrapperNode [2024-11-20 05:29:01,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:29:01,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:29:01,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:29:01,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:29:01,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (1/1) ... [2024-11-20 05:29:01,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (1/1) ... [2024-11-20 05:29:01,222 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2024-11-20 05:29:01,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:29:01,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:29:01,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:29:01,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:29:01,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (1/1) ... [2024-11-20 05:29:01,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (1/1) ... [2024-11-20 05:29:01,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (1/1) ... [2024-11-20 05:29:01,268 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-20 05:29:01,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (1/1) ... [2024-11-20 05:29:01,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (1/1) ... [2024-11-20 05:29:01,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (1/1) ... [2024-11-20 05:29:01,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (1/1) ... [2024-11-20 05:29:01,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (1/1) ... [2024-11-20 05:29:01,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (1/1) ... [2024-11-20 05:29:01,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:29:01,290 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:29:01,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:29:01,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:29:01,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (1/1) ... [2024-11-20 05:29:01,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:29:01,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:29:01,339 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-20 05:29:01,343 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-20 05:29:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:29:01,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:29:01,397 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:29:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:29:01,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:29:01,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:29:01,502 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:29:01,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:29:01,967 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 05:29:01,967 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:29:01,984 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:29:01,985 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:29:01,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:29:01 BoogieIcfgContainer [2024-11-20 05:29:01,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:29:01,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:29:01,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:29:01,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:29:01,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:29:00" (1/3) ... [2024-11-20 05:29:01,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d900c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:29:01, skipping insertion in model container [2024-11-20 05:29:01,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:01" (2/3) ... [2024-11-20 05:29:01,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d900c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:29:01, skipping insertion in model container [2024-11-20 05:29:01,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:29:01" (3/3) ... [2024-11-20 05:29:01,998 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i [2024-11-20 05:29:02,015 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:29:02,015 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:29:02,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:29:02,091 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;@4c848e95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:29:02,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:29:02,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 72 states have internal predecessors, (106), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 05:29:02,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 05:29:02,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:29:02,112 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:29:02,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:29:02,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:29:02,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1945386396, now seen corresponding path program 1 times [2024-11-20 05:29:02,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:29:02,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435246906] [2024-11-20 05:29:02,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:29:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:29:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:29:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:29:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:29:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:29:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:29:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:29:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:29:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:29:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:29:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:29:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:29:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 05:29:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 05:29:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 05:29:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 05:29:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 05:29:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 05:29:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 05:29:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 05:29:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 05:29:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:29:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 05:29:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:29:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:29:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:29:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:29:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 05:29:02,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:29:02,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435246906] [2024-11-20 05:29:02,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435246906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:29:02,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:29:02,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:29:02,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816867115] [2024-11-20 05:29:02,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:29:02,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:29:02,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:29:02,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:29:02,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:29:02,700 INFO L87 Difference]: Start difference. First operand has 100 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 72 states have internal predecessors, (106), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 05:29:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:29:02,736 INFO L93 Difference]: Finished difference Result 193 states and 336 transitions. [2024-11-20 05:29:02,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:29:02,738 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 177 [2024-11-20 05:29:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:29:02,748 INFO L225 Difference]: With dead ends: 193 [2024-11-20 05:29:02,748 INFO L226 Difference]: Without dead ends: 96 [2024-11-20 05:29:02,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-20 05:29:02,758 INFO L432 NwaCegarLoop]: 151 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, 151 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-20 05:29:02,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:29:02,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-20 05:29:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-20 05:29:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 68 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 05:29:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 151 transitions. [2024-11-20 05:29:02,829 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 151 transitions. Word has length 177 [2024-11-20 05:29:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:29:02,829 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 151 transitions. [2024-11-20 05:29:02,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 05:29:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 151 transitions. [2024-11-20 05:29:02,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-20 05:29:02,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:29:02,837 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:29:02,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:29:02,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:29:02,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:29:02,839 INFO L85 PathProgramCache]: Analyzing trace with hash 297771808, now seen corresponding path program 1 times [2024-11-20 05:29:02,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:29:02,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626846631] [2024-11-20 05:29:02,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:29:02,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:29:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:29:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:29:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:29:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:29:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:29:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:29:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:29:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:29:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:29:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:29:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:29:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 05:29:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 05:29:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 05:29:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 05:29:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 05:29:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 05:29:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 05:29:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 05:29:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 05:29:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:29:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 05:29:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:29:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:29:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:29:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:29:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 05:29:03,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:29:03,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626846631] [2024-11-20 05:29:03,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626846631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:29:03,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:29:03,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:29:03,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904809890] [2024-11-20 05:29:03,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:29:03,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:29:03,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:29:03,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:29:03,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:29:03,655 INFO L87 Difference]: Start difference. First operand 96 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 05:29:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:29:03,882 INFO L93 Difference]: Finished difference Result 309 states and 489 transitions. [2024-11-20 05:29:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:29:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-20 05:29:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:29:03,887 INFO L225 Difference]: With dead ends: 309 [2024-11-20 05:29:03,887 INFO L226 Difference]: Without dead ends: 216 [2024-11-20 05:29:03,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:29:03,889 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 155 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:29:03,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 458 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:29:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-20 05:29:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 187. [2024-11-20 05:29:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 132 states have (on average 1.4242424242424243) internal successors, (188), 132 states have internal predecessors, (188), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 05:29:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 292 transitions. [2024-11-20 05:29:03,941 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 292 transitions. Word has length 177 [2024-11-20 05:29:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:29:03,942 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 292 transitions. [2024-11-20 05:29:03,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 05:29:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 292 transitions. [2024-11-20 05:29:03,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-20 05:29:03,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:29:03,952 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:29:03,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:29:03,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:29:03,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:29:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1339546311, now seen corresponding path program 1 times [2024-11-20 05:29:03,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:29:03,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963493643] [2024-11-20 05:29:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:29:03,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:29:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:29:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:29:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:29:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:29:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:29:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:29:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:29:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:29:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:29:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:29:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:29:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 05:29:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 05:29:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 05:29:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 05:29:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 05:29:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 05:29:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 05:29:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 05:29:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 05:29:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:29:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 05:29:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:29:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:29:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:29:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:29:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-20 05:29:04,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:29:04,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963493643] [2024-11-20 05:29:04,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963493643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:29:04,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984108934] [2024-11-20 05:29:04,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:29:04,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:29:04,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:29:04,934 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-20 05:29:04,935 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-20 05:29:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:05,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 05:29:05,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:29:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 52 proven. 144 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 05:29:05,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:29:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-20 05:29:05,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984108934] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:29:05,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 05:29:05,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-11-20 05:29:05,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913383986] [2024-11-20 05:29:05,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 05:29:05,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 05:29:05,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:29:05,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 05:29:05,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-20 05:29:05,864 INFO L87 Difference]: Start difference. First operand 187 states and 292 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) [2024-11-20 05:29:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:29:06,360 INFO L93 Difference]: Finished difference Result 302 states and 458 transitions. [2024-11-20 05:29:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 05:29:06,363 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) Word has length 178 [2024-11-20 05:29:06,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:29:06,367 INFO L225 Difference]: With dead ends: 302 [2024-11-20 05:29:06,368 INFO L226 Difference]: Without dead ends: 209 [2024-11-20 05:29:06,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2024-11-20 05:29:06,370 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 358 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:29:06,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 363 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:29:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-20 05:29:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 203. [2024-11-20 05:29:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 144 states have (on average 1.3541666666666667) internal successors, (195), 144 states have internal predecessors, (195), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 05:29:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 299 transitions. [2024-11-20 05:29:06,421 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 299 transitions. Word has length 178 [2024-11-20 05:29:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:29:06,423 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 299 transitions. [2024-11-20 05:29:06,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) [2024-11-20 05:29:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 299 transitions. [2024-11-20 05:29:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 05:29:06,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:29:06,431 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:29:06,443 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-20 05:29:06,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:29:06,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:29:06,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:29:06,635 INFO L85 PathProgramCache]: Analyzing trace with hash -661032954, now seen corresponding path program 1 times [2024-11-20 05:29:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:29:06,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006337289] [2024-11-20 05:29:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:29:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:29:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:29:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:29:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:29:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:29:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:29:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:29:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:29:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:29:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:29:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 05:29:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:29:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 05:29:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 05:29:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 05:29:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 05:29:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 05:29:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 05:29:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 05:29:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 05:29:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 05:29:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 05:29:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 05:29:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 05:29:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 05:29:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 05:29:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 05:29:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 05:29:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:29:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006337289] [2024-11-20 05:29:06,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006337289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:29:06,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:29:06,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:29:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106827183] [2024-11-20 05:29:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:29:06,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:29:06,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:29:06,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:29:06,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:29:06,818 INFO L87 Difference]: Start difference. First operand 203 states and 299 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 05:29:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:29:06,873 INFO L93 Difference]: Finished difference Result 403 states and 595 transitions. [2024-11-20 05:29:06,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:29:06,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 179 [2024-11-20 05:29:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:29:06,877 INFO L225 Difference]: With dead ends: 403 [2024-11-20 05:29:06,877 INFO L226 Difference]: Without dead ends: 203 [2024-11-20 05:29:06,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-20 05:29:06,882 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:29:06,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:29:06,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-20 05:29:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-20 05:29:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 144 states have (on average 1.3402777777777777) internal successors, (193), 144 states have internal predecessors, (193), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 05:29:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 297 transitions. [2024-11-20 05:29:06,908 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 297 transitions. Word has length 179 [2024-11-20 05:29:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:29:06,909 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 297 transitions. [2024-11-20 05:29:06,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 05:29:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 297 transitions. [2024-11-20 05:29:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-20 05:29:06,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:29:06,911 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:29:06,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:29:06,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:29:06,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:29:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash 787180292, now seen corresponding path program 1 times [2024-11-20 05:29:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:29:06,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017333186] [2024-11-20 05:29:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:29:06,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:29:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:29:07,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:29:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:29:07,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:29:07,165 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:29:07,169 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:29:07,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:29:07,176 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 05:29:07,352 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:29:07,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:29:07 BoogieIcfgContainer [2024-11-20 05:29:07,355 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:29:07,356 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:29:07,356 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:29:07,356 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:29:07,356 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:29:01" (3/4) ... [2024-11-20 05:29:07,360 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:29:07,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:29:07,362 INFO L158 Benchmark]: Toolchain (without parser) took 6628.64ms. Allocated memory was 176.2MB in the beginning and 245.4MB in the end (delta: 69.2MB). Free memory was 105.6MB in the beginning and 199.5MB in the end (delta: -93.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:29:07,362 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory was 132.4MB in the beginning and 132.3MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:29:07,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.05ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 88.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 05:29:07,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.22ms. Allocated memory is still 176.2MB. Free memory was 88.4MB in the beginning and 145.6MB in the end (delta: -57.2MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-20 05:29:07,366 INFO L158 Benchmark]: Boogie Preprocessor took 63.52ms. Allocated memory is still 176.2MB. Free memory was 145.6MB in the beginning and 142.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 05:29:07,367 INFO L158 Benchmark]: RCFGBuilder took 695.12ms. Allocated memory is still 176.2MB. Free memory was 142.2MB in the beginning and 117.7MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 05:29:07,367 INFO L158 Benchmark]: TraceAbstraction took 5367.37ms. Allocated memory was 176.2MB in the beginning and 245.4MB in the end (delta: 69.2MB). Free memory was 117.0MB in the beginning and 200.6MB in the end (delta: -83.6MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. [2024-11-20 05:29:07,367 INFO L158 Benchmark]: Witness Printer took 5.65ms. Allocated memory is still 245.4MB. Free memory was 200.6MB in the beginning and 199.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 05:29:07,369 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory was 132.4MB in the beginning and 132.3MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.05ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 88.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.22ms. Allocated memory is still 176.2MB. Free memory was 88.4MB in the beginning and 145.6MB in the end (delta: -57.2MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.52ms. Allocated memory is still 176.2MB. Free memory was 145.6MB in the beginning and 142.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 695.12ms. Allocated memory is still 176.2MB. Free memory was 142.2MB in the beginning and 117.7MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5367.37ms. Allocated memory was 176.2MB in the beginning and 245.4MB in the end (delta: 69.2MB). Free memory was 117.0MB in the beginning and 200.6MB in the end (delta: -83.6MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. * Witness Printer took 5.65ms. Allocated memory is still 245.4MB. Free memory was 200.6MB in the beginning and 199.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 184, overapproximation of someBinaryArithmeticDOUBLEoperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 204, overapproximation of someBinaryArithmeticFLOAToperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_21 = 100.4; [L37] signed long int var_1_24 = 10; [L38] signed char var_1_25 = -8; [L39] double var_1_26 = 9.75; [L40] signed char var_1_28 = 8; [L41] unsigned long int var_1_29 = 16; [L42] unsigned long int var_1_30 = 1; [L43] float var_1_31 = 16.6; [L44] float var_1_33 = 0.25; [L45] float var_1_34 = 99.8; [L46] signed short int var_1_35 = 256; [L47] unsigned long int var_1_36 = 16; [L48] double var_1_37 = 8.5; [L49] unsigned long int var_1_38 = 3569725445; [L50] unsigned long int var_1_39 = 3551809449; [L51] unsigned long int var_1_40 = 10000000; [L52] unsigned char last_1_var_1_1 = 1; [L53] signed long int last_1_var_1_11 = -2; [L54] signed long int last_1_var_1_15 = 1000; [L55] double last_1_var_1_16 = 0.2; VAL [isInitial=0, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L208] isInitial = 1 [L209] FCALL initially() [L210] COND TRUE 1 [L211] CALL updateLastVariables() [L198] last_1_var_1_1 = var_1_1 [L199] last_1_var_1_11 = var_1_11 [L200] last_1_var_1_15 = var_1_15 [L201] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L211] RET updateLastVariables() [L212] CALL updateVariables() [L153] var_1_4 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L154] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L155] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L155] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L156] var_1_7 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L157] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L158] var_1_10 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L159] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L160] var_1_13 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L161] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L162] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L162] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L163] var_1_14 = __VERIFIER_nondet_long() [L164] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L164] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L165] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L165] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L166] var_1_17 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L167] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L168] var_1_18 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L169] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L170] var_1_21 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L171] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L172] var_1_26 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L173] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L174] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L174] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L175] var_1_28 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L176] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L177] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L177] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L178] var_1_30 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L179] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L180] CALL assume_abort_if_not(var_1_30 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L180] RET assume_abort_if_not(var_1_30 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L181] var_1_33 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L182] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L183] var_1_34 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L184] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L185] var_1_37 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L186] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L187] var_1_38 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L188] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L189] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L189] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L190] var_1_39 = __VERIFIER_nondet_ulong() [L191] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L191] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L192] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L192] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L193] var_1_40 = __VERIFIER_nondet_ulong() [L194] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L194] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L195] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L195] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L212] RET updateVariables() [L213] CALL step() [L59] COND FALSE !((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) - var_1_21) == (var_1_8 * var_1_16)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L62] var_1_24 = var_1_11 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=-2, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L63] COND TRUE var_1_21 != var_1_5 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=-2, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L64] COND TRUE var_1_5 < (var_1_5 / var_1_26) [L65] var_1_25 = ((((4) < 0 ) ? -(4) : (4))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=16, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L76] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L77] COND FALSE !(var_1_16 > var_1_16) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L84] COND TRUE \read(var_1_1) [L85] var_1_31 = ((((((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) < 0 ) ? -((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) : ((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))))) - 256.35f) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L88] COND FALSE !(! ((1 + var_1_11) <= var_1_15)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L93] COND FALSE !(var_1_21 < var_1_5) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L100] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L101] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L102] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L107] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L108] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L109] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L111] signed long int stepLocal_2 = var_1_11; [L112] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L113] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L114] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L115] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L116] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L122] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L122] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L133] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L135] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L136] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L140] COND TRUE 10.55f < var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L141] COND TRUE var_1_16 > (var_1_7 * var_1_16) [L142] var_1_8 = ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L213] RET step() [L214] CALL, EXPR property() [L204] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L204-L205] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-64, var_1_1=-255, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=0, var_1_30=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 513 mSDsluCounter, 1232 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 642 mSDsCounter, 194 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 302 IncrementalHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 194 mSolverCounterUnsat, 590 mSDtfsCounter, 302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 616 GetRequests, 590 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 4 MinimizatonAttempts, 35 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1069 NumberOfCodeBlocks, 1069 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1061 ConstructedInterpolants, 0 QuantifiedInterpolants, 2391 SizeOfPredicates, 1 NumberOfNonLiveVariables, 411 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 7506/7800 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-20 05:29:07,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.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 e111ddb7b29b83b3c4c599c467dcaa70af487d74dbca60ec39ae91f7f9b2341e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:29:09,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:29:09,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:29:09,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:29:09,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:29:09,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:29:09,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:29:09,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:29:09,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:29:09,992 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:29:09,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:29:09,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:29:09,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:29:09,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:29:09,997 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:29:09,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:29:09,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:29:09,998 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:29:09,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:29:10,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:29:10,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:29:10,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:29:10,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:29:10,004 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:29:10,005 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:29:10,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:29:10,005 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:29:10,005 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:29:10,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:29:10,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:29:10,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:29:10,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:29:10,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:29:10,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:29:10,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:29:10,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:29:10,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:29:10,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:29:10,010 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:29:10,011 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:29:10,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:29:10,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:29:10,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:29:10,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:29:10,013 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 -> e111ddb7b29b83b3c4c599c467dcaa70af487d74dbca60ec39ae91f7f9b2341e [2024-11-20 05:29:10,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:29:10,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:29:10,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:29:10,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:29:10,464 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:29:10,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i [2024-11-20 05:29:12,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:29:12,424 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:29:12,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i [2024-11-20 05:29:12,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f898db463/17f85fdaf44d4d4694bc8cef1595c5ae/FLAG0fdb87c20 [2024-11-20 05:29:12,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f898db463/17f85fdaf44d4d4694bc8cef1595c5ae [2024-11-20 05:29:12,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:29:12,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:29:12,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:29:12,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:29:12,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:29:12,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:12,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d8b98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12, skipping insertion in model container [2024-11-20 05:29:12,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:12,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:29:12,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i[919,932] [2024-11-20 05:29:12,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:29:12,848 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:29:12,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i[919,932] [2024-11-20 05:29:12,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:29:12,945 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:29:12,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12 WrapperNode [2024-11-20 05:29:12,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:29:12,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:29:12,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:29:12,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:29:12,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:12,974 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:13,018 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-20 05:29:13,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:29:13,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:29:13,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:29:13,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:29:13,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:13,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:13,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:13,084 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-20 05:29:13,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:13,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:13,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:13,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:13,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:13,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:13,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:29:13,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:29:13,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:29:13,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:29:13,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (1/1) ... [2024-11-20 05:29:13,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:29:13,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:29:13,165 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-20 05:29:13,172 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-20 05:29:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:29:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:29:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:29:13,208 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:29:13,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:29:13,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:29:13,301 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:29:13,303 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:29:39,578 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 05:29:39,578 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:29:39,595 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:29:39,595 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:29:39,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:29:39 BoogieIcfgContainer [2024-11-20 05:29:39,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:29:39,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:29:39,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:29:39,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:29:39,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:29:12" (1/3) ... [2024-11-20 05:29:39,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368789cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:29:39, skipping insertion in model container [2024-11-20 05:29:39,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:29:12" (2/3) ... [2024-11-20 05:29:39,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368789cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:29:39, skipping insertion in model container [2024-11-20 05:29:39,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:29:39" (3/3) ... [2024-11-20 05:29:39,604 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-30.i [2024-11-20 05:29:39,619 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:29:39,619 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:29:39,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:29:39,701 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;@567b48b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:29:39,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:29:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 05:29:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-20 05:29:39,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:29:39,727 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:29:39,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:29:39,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:29:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash 142466106, now seen corresponding path program 1 times [2024-11-20 05:29:39,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:29:39,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145491547] [2024-11-20 05:29:39,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:29:39,752 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-20 05:29:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:29:39,755 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-20 05:29:39,757 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-20 05:29:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:41,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:29:41,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:29:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-20 05:29:41,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:29:41,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:29:41,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145491547] [2024-11-20 05:29:41,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145491547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:29:41,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:29:41,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:29:41,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476935166] [2024-11-20 05:29:41,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:29:41,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:29:41,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:29:41,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:29:41,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:29:41,313 INFO L87 Difference]: Start difference. First operand has 91 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 05:29:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:29:41,359 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2024-11-20 05:29:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:29:41,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2024-11-20 05:29:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:29:41,373 INFO L225 Difference]: With dead ends: 173 [2024-11-20 05:29:41,373 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 05:29:41,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:29:41,383 INFO L432 NwaCegarLoop]: 132 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, 132 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-20 05:29:41,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:29:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 05:29:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-20 05:29:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-20 05:29:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2024-11-20 05:29:41,434 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 174 [2024-11-20 05:29:41,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:29:41,434 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2024-11-20 05:29:41,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-20 05:29:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2024-11-20 05:29:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-20 05:29:41,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:29:41,446 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:29:41,484 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-20 05:29:41,647 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-20 05:29:41,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:29:41,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:29:41,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1569981750, now seen corresponding path program 1 times [2024-11-20 05:29:41,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:29:41,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691522891] [2024-11-20 05:29:41,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:29:41,650 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-20 05:29:41,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:29:41,654 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-20 05:29:41,655 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-20 05:29:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:29:43,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 05:29:43,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:29:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-20 05:29:46,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:29:46,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:29:46,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691522891] [2024-11-20 05:29:46,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691522891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:29:46,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:29:46,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:29:46,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750851957] [2024-11-20 05:29:46,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:29:46,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:29:46,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:29:46,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:29:46,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:29:46,595 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 05:29:51,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:29:54,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:30:00,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:30:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:00,141 INFO L93 Difference]: Finished difference Result 267 states and 418 transitions. [2024-11-20 05:30:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:30:00,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-20 05:30:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:00,191 INFO L225 Difference]: With dead ends: 267 [2024-11-20 05:30:00,192 INFO L226 Difference]: Without dead ends: 185 [2024-11-20 05:30:00,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:30:00,194 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 116 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:00,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 390 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 23 Invalid, 2 Unknown, 0 Unchecked, 13.4s Time] [2024-11-20 05:30:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-20 05:30:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2024-11-20 05:30:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 110 states have internal predecessors, (151), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 05:30:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 255 transitions. [2024-11-20 05:30:00,238 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 255 transitions. Word has length 174 [2024-11-20 05:30:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:00,239 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 255 transitions. [2024-11-20 05:30:00,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-20 05:30:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 255 transitions. [2024-11-20 05:30:00,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 05:30:00,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:00,243 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:30:00,292 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-20 05:30:00,444 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-20 05:30:00,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:00,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:00,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1734904125, now seen corresponding path program 1 times [2024-11-20 05:30:00,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:30:00,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876894229] [2024-11-20 05:30:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:00,446 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-20 05:30:00,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:30:00,449 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-20 05:30:00,451 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-20 05:30:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:01,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 05:30:01,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 52 proven. 144 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 05:30:09,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:30:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-20 05:30:12,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:30:12,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876894229] [2024-11-20 05:30:12,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876894229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:30:12,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 05:30:12,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-20 05:30:12,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704060284] [2024-11-20 05:30:12,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 05:30:12,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 05:30:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:30:12,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 05:30:12,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:30:12,402 INFO L87 Difference]: Start difference. First operand 165 states and 255 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) [2024-11-20 05:30:20,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:30:24,641 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-20 05:30:28,645 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 []