./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.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 fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:52:49,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:52:49,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:52:49,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:52:49,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:52:49,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:52:49,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:52:49,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:52:49,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:52:49,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:52:49,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:52:49,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:52:49,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:52:49,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:52:49,692 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:52:49,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:52:49,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:52:49,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:52:49,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:52:49,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:52:49,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:52:49,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:52:49,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:52:49,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:52:49,697 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:52:49,698 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:52:49,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:52:49,698 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:52:49,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:52:49,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:52:49,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:52:49,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:52:49,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:52:49,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:52:49,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:52:49,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:52:49,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:52:49,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:52:49,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:52:49,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:52:49,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:52:49,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:52:49,701 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 -> fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f [2024-11-12 04:52:49,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:52:49,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:52:49,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:52:49,955 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:52:49,955 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:52:49,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2024-11-12 04:52:51,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:52:51,420 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:52:51,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2024-11-12 04:52:51,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f2c4b5d/c09cfd91f192440fa96767c52e1d61d0/FLAG8545773d7 [2024-11-12 04:52:51,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f2c4b5d/c09cfd91f192440fa96767c52e1d61d0 [2024-11-12 04:52:51,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:52:51,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:52:51,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:52:51,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:52:51,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:52:51,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:52:51" (1/1) ... [2024-11-12 04:52:51,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c9c7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:51, skipping insertion in model container [2024-11-12 04:52:51,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:52:51" (1/1) ... [2024-11-12 04:52:51,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:52:51,994 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2024-11-12 04:52:52,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:52:52,048 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:52:52,058 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2024-11-12 04:52:52,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:52:52,090 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:52:52,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52 WrapperNode [2024-11-12 04:52:52,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:52:52,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:52:52,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:52:52,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:52:52,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (1/1) ... [2024-11-12 04:52:52,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (1/1) ... [2024-11-12 04:52:52,130 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-11-12 04:52:52,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:52:52,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:52:52,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:52:52,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:52:52,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (1/1) ... [2024-11-12 04:52:52,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (1/1) ... [2024-11-12 04:52:52,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (1/1) ... [2024-11-12 04:52:52,157 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-12 04:52:52,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (1/1) ... [2024-11-12 04:52:52,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (1/1) ... [2024-11-12 04:52:52,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (1/1) ... [2024-11-12 04:52:52,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (1/1) ... [2024-11-12 04:52:52,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (1/1) ... [2024-11-12 04:52:52,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (1/1) ... [2024-11-12 04:52:52,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:52:52,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:52:52,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:52:52,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:52:52,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (1/1) ... [2024-11-12 04:52:52,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:52:52,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:52:52,213 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-12 04:52:52,224 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-12 04:52:52,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:52:52,260 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:52:52,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:52:52,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:52:52,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:52:52,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:52:52,329 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:52:52,331 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:52:52,621 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 04:52:52,621 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:52:52,635 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:52:52,635 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:52:52,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:52 BoogieIcfgContainer [2024-11-12 04:52:52,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:52:52,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:52:52,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:52:52,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:52:52,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:52:51" (1/3) ... [2024-11-12 04:52:52,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fc628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:52:52, skipping insertion in model container [2024-11-12 04:52:52,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:52:52" (2/3) ... [2024-11-12 04:52:52,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fc628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:52:52, skipping insertion in model container [2024-11-12 04:52:52,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:52" (3/3) ... [2024-11-12 04:52:52,645 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-81.i [2024-11-12 04:52:52,659 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:52:52,660 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:52:52,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:52:52,720 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;@8804373, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:52:52,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:52:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 04:52:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 04:52:52,736 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:52:52,736 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:52:52,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:52:52,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:52:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash -57449186, now seen corresponding path program 1 times [2024-11-12 04:52:52,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:52:52,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280918175] [2024-11-12 04:52:52,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:52,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:52:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:52,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:52:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:52,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:52:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:52,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:52:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:52,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:52:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:52,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:52:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:52,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:52:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:52:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:52:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:52:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:52:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:52:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:52:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:52:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:52:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:52:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:52:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:52:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:52:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:52:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:52:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:52:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:52:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 04:52:53,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:52:53,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280918175] [2024-11-12 04:52:53,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280918175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:52:53,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:52:53,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:52:53,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812120468] [2024-11-12 04:52:53,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:52:53,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:52:53,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:52:53,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:52:53,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:52:53,129 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 04:52:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:52:53,150 INFO L93 Difference]: Finished difference Result 135 states and 232 transitions. [2024-11-12 04:52:53,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:52:53,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2024-11-12 04:52:53,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:52:53,158 INFO L225 Difference]: With dead ends: 135 [2024-11-12 04:52:53,158 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 04:52:53,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-12 04:52:53,163 INFO L435 NwaCegarLoop]: 101 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, 101 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-12 04:52:53,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:52:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 04:52:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-12 04:52:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 04:52:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-12 04:52:53,198 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 139 [2024-11-12 04:52:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:52:53,198 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-12 04:52:53,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 04:52:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-12 04:52:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 04:52:53,201 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:52:53,202 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:52:53,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:52:53,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:52:53,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:52:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1630273954, now seen corresponding path program 1 times [2024-11-12 04:52:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:52:53,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369968775] [2024-11-12 04:52:53,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:53,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:52:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:52:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:52:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:52:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:52:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:52:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:52:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:52:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:52:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:52:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:52:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:52:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:52:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:52:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:52:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:52:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:52:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:52:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:52:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:52:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:52:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:52:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:52:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 04:52:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:52:53,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369968775] [2024-11-12 04:52:53,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369968775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:52:53,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:52:53,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:52:53,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572165002] [2024-11-12 04:52:53,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:52:53,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:52:53,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:52:53,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:52:53,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:52:53,498 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 04:52:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:52:53,692 INFO L93 Difference]: Finished difference Result 196 states and 298 transitions. [2024-11-12 04:52:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:52:53,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2024-11-12 04:52:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:52:53,694 INFO L225 Difference]: With dead ends: 196 [2024-11-12 04:52:53,695 INFO L226 Difference]: Without dead ends: 132 [2024-11-12 04:52:53,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-12 04:52:53,696 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 69 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:52:53,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 261 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:52:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-12 04:52:53,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2024-11-12 04:52:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 04:52:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 187 transitions. [2024-11-12 04:52:53,724 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 187 transitions. Word has length 139 [2024-11-12 04:52:53,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:52:53,726 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 187 transitions. [2024-11-12 04:52:53,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 04:52:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 187 transitions. [2024-11-12 04:52:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 04:52:53,729 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:52:53,729 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:52:53,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:52:53,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:52:53,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:52:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash -997672829, now seen corresponding path program 1 times [2024-11-12 04:52:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:52:53,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959015665] [2024-11-12 04:52:53,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:53,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:52:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:52:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:52:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:52:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:52:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:52:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:52:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:52:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:52:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:52:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:52:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:52:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:52:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:52:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:52:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:52:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:52:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:52:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:52:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:52:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:52:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:52:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:52:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 04:52:54,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:52:54,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959015665] [2024-11-12 04:52:54,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959015665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:52:54,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:52:54,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:52:54,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961317159] [2024-11-12 04:52:54,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:52:54,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:52:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:52:54,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:52:54,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:52:54,643 INFO L87 Difference]: Start difference. First operand 123 states and 187 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 04:52:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:52:54,744 INFO L93 Difference]: Finished difference Result 207 states and 311 transitions. [2024-11-12 04:52:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:52:54,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2024-11-12 04:52:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:52:54,749 INFO L225 Difference]: With dead ends: 207 [2024-11-12 04:52:54,749 INFO L226 Difference]: Without dead ends: 143 [2024-11-12 04:52:54,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:52:54,751 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 17 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:52:54,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 482 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:52:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-12 04:52:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 127. [2024-11-12 04:52:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 04:52:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 191 transitions. [2024-11-12 04:52:54,771 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 191 transitions. Word has length 140 [2024-11-12 04:52:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:52:54,773 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 191 transitions. [2024-11-12 04:52:54,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 04:52:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 191 transitions. [2024-11-12 04:52:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 04:52:54,776 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:52:54,776 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:52:54,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:52:54,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:52:54,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:52:54,777 INFO L85 PathProgramCache]: Analyzing trace with hash 777334533, now seen corresponding path program 1 times [2024-11-12 04:52:54,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:52:54,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388887181] [2024-11-12 04:52:54,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:54,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:52:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:52:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:52:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:52:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:52:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:52:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:52:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:52:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:52:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:52:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:52:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:52:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:52:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:52:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:52:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:52:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:52:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:52:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:52:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:52:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:52:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:52:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:52:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 04:52:55,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:52:55,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388887181] [2024-11-12 04:52:55,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388887181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:52:55,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:52:55,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:52:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806661092] [2024-11-12 04:52:55,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:52:55,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:52:55,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:52:55,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:52:55,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:52:55,510 INFO L87 Difference]: Start difference. First operand 127 states and 191 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 04:52:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:52:55,567 INFO L93 Difference]: Finished difference Result 226 states and 337 transitions. [2024-11-12 04:52:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:52:55,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 140 [2024-11-12 04:52:55,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:52:55,571 INFO L225 Difference]: With dead ends: 226 [2024-11-12 04:52:55,573 INFO L226 Difference]: Without dead ends: 155 [2024-11-12 04:52:55,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:52:55,574 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 25 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:52:55,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 563 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:52:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-12 04:52:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2024-11-12 04:52:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 04:52:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2024-11-12 04:52:55,599 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 203 transitions. Word has length 140 [2024-11-12 04:52:55,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:52:55,601 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 203 transitions. [2024-11-12 04:52:55,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 04:52:55,602 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 203 transitions. [2024-11-12 04:52:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 04:52:55,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:52:55,607 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:52:55,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:52:55,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:52:55,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:52:55,608 INFO L85 PathProgramCache]: Analyzing trace with hash 631822388, now seen corresponding path program 1 times [2024-11-12 04:52:55,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:52:55,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977979090] [2024-11-12 04:52:55,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:55,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:52:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:52:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:52:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:52:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:52:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:52:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:52:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:52:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:52:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:52:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:52:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:52:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:52:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:52:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:52:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:52:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:52:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:52:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:52:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:52:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:52:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:52:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:52:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:52:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 04:52:55,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:52:55,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977979090] [2024-11-12 04:52:55,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977979090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:52:55,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:52:55,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:52:55,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140522942] [2024-11-12 04:52:55,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:52:55,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:52:55,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:52:55,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:52:55,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:52:55,842 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 04:52:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:52:56,000 INFO L93 Difference]: Finished difference Result 233 states and 347 transitions. [2024-11-12 04:52:56,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:52:56,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-11-12 04:52:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:52:56,002 INFO L225 Difference]: With dead ends: 233 [2024-11-12 04:52:56,003 INFO L226 Difference]: Without dead ends: 144 [2024-11-12 04:52:56,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-12 04:52:56,005 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 60 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:52:56,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 266 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:52:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-12 04:52:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 135. [2024-11-12 04:52:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 04:52:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2024-11-12 04:52:56,028 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 143 [2024-11-12 04:52:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:52:56,029 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2024-11-12 04:52:56,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 04:52:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2024-11-12 04:52:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 04:52:56,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:52:56,032 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:52:56,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:52:56,032 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:52:56,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:52:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash 254517518, now seen corresponding path program 1 times [2024-11-12 04:52:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:52:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7552951] [2024-11-12 04:52:56,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:52:56,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:52:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:52:56,121 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:52:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:52:56,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:52:56,204 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:52:56,205 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:52:56,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:52:56,211 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 04:52:56,292 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:52:56,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:52:56 BoogieIcfgContainer [2024-11-12 04:52:56,299 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:52:56,300 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:52:56,300 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:52:56,300 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:52:56,300 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:52:52" (3/4) ... [2024-11-12 04:52:56,302 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:52:56,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:52:56,304 INFO L158 Benchmark]: Toolchain (without parser) took 4482.70ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 120.5MB in the beginning and 145.1MB in the end (delta: -24.6MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-11-12 04:52:56,304 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 100.7MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:52:56,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.65ms. Allocated memory is still 161.5MB. Free memory was 119.9MB in the beginning and 105.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:52:56,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.33ms. Allocated memory is still 161.5MB. Free memory was 105.3MB in the beginning and 102.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:52:56,305 INFO L158 Benchmark]: Boogie Preprocessor took 38.87ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 99.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:52:56,305 INFO L158 Benchmark]: RCFGBuilder took 465.06ms. Allocated memory is still 161.5MB. Free memory was 99.0MB in the beginning and 117.9MB in the end (delta: -18.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 04:52:56,305 INFO L158 Benchmark]: TraceAbstraction took 3661.48ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 117.4MB in the beginning and 145.1MB in the end (delta: -27.7MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2024-11-12 04:52:56,305 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 234.9MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:52:56,306 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 100.7MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.65ms. Allocated memory is still 161.5MB. Free memory was 119.9MB in the beginning and 105.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.33ms. Allocated memory is still 161.5MB. Free memory was 105.3MB in the beginning and 102.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.87ms. Allocated memory is still 161.5MB. Free memory was 102.6MB in the beginning and 99.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 465.06ms. Allocated memory is still 161.5MB. Free memory was 99.0MB in the beginning and 117.9MB in the end (delta: -18.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3661.48ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 117.4MB in the beginning and 145.1MB in the end (delta: -27.7MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 234.9MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 110. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 9999; [L23] unsigned char var_1_2 = 1; [L24] signed long int var_1_3 = 4; [L25] signed long int var_1_4 = 2; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 999999999; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = 16; [L30] signed char var_1_12 = 16; [L31] unsigned short int var_1_13 = 5; [L32] unsigned char var_1_14 = 1; [L33] unsigned short int var_1_15 = 16; [L34] unsigned short int var_1_16 = 32647; [L35] unsigned short int var_1_17 = 128; [L36] signed long int var_1_18 = -8; [L37] unsigned short int last_1_var_1_13 = 5; [L38] signed long int last_1_var_1_18 = -8; VAL [isInitial=0, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L114] isInitial = 1 [L115] FCALL initially() [L116] COND TRUE 1 [L117] CALL updateLastVariables() [L106] last_1_var_1_13 = var_1_13 [L107] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L117] RET updateLastVariables() [L118] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L75] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L76] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L76] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L79] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L79] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L80] var_1_5 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_5 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L81] RET assume_abort_if_not(var_1_5 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L82] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L82] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L83] var_1_6 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L86] var_1_11 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L89] var_1_12 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L92] var_1_14 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L95] var_1_15 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L98] var_1_16 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L99] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L100] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L100] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L101] var_1_17 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L102] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L103] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L103] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L118] RET updateVariables() [L119] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18)); VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L43] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L43] COND FALSE !(stepLocal_0 != (last_1_var_1_18 ^ last_1_var_1_13)) [L48] var_1_7 = ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-59] [L50] unsigned char stepLocal_1 = var_1_11 >= var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_1=1, var_1_11=63, var_1_12=-59, var_1_13=5, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-59] [L51] COND TRUE stepLocal_1 && var_1_14 [L52] var_1_13 = ((((var_1_15) < (100)) ? (var_1_15) : (100))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-59] [L56] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_2=-59, var_1_11=63, var_1_12=-59, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-59] [L57] COND FALSE !(stepLocal_2 > var_1_16) [L64] var_1_18 = var_1_15 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=100, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-59] [L66] COND TRUE \read(var_1_2) [L67] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=100, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-59] [L119] RET step() [L120] CALL, EXPR property() [L110] EXPR (var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=100, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-59] [L110] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=100, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-59] [L110] EXPR (var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=100, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-59] [L110-L111] return (((var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))))))) && (((var_1_11 >= var_1_7) && var_1_14) ? (var_1_13 == ((unsigned short int) ((((var_1_15) < (100)) ? (var_1_15) : (100))))) : (var_1_13 == ((unsigned short int) ((var_1_16 - 5) + var_1_17))))) && ((var_1_7 > var_1_16) ? ((var_1_3 < (var_1_5 - var_1_6)) ? (var_1_18 == ((signed long int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) : (var_1_18 == ((signed long int) var_1_13))) : (var_1_18 == ((signed long int) var_1_15))) ; [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=100, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-59] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=63, var_1_12=-59, var_1_13=100, var_1_14=1, var_1_15=100, var_1_16=16383, var_1_17=-65536, var_1_18=100, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-59] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 1673 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1161 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 512 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 54 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 848 NumberOfCodeBlocks, 848 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 696 ConstructedInterpolants, 0 QuantifiedInterpolants, 1192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4620/4620 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-12 04:52:56,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.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 fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:52:58,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:52:58,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:52:58,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:52:58,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:52:58,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:52:58,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:52:58,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:52:58,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:52:58,365 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:52:58,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:52:58,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:52:58,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:52:58,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:52:58,367 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:52:58,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:52:58,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:52:58,368 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:52:58,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:52:58,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:52:58,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:52:58,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:52:58,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:52:58,369 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:52:58,370 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:52:58,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:52:58,372 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:52:58,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:52:58,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:52:58,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:52:58,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:52:58,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:52:58,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:52:58,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:52:58,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:52:58,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:52:58,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:52:58,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:52:58,374 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:52:58,374 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:52:58,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:52:58,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:52:58,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:52:58,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:52:58,375 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 -> fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f [2024-11-12 04:52:58,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:52:58,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:52:58,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:52:58,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:52:58,677 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:52:58,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2024-11-12 04:52:59,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:53:00,165 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:53:00,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2024-11-12 04:53:00,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5849e81fe/1a5d8c09a7b24c3faab5acb0e85458a8/FLAG3be17da7e [2024-11-12 04:53:00,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5849e81fe/1a5d8c09a7b24c3faab5acb0e85458a8 [2024-11-12 04:53:00,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:53:00,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:53:00,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:53:00,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:53:00,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:53:00,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3769d6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00, skipping insertion in model container [2024-11-12 04:53:00,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:53:00,378 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2024-11-12 04:53:00,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:53:00,449 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:53:00,462 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2024-11-12 04:53:00,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:53:00,505 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:53:00,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00 WrapperNode [2024-11-12 04:53:00,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:53:00,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:53:00,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:53:00,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:53:00,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,551 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-12 04:53:00,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:53:00,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:53:00,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:53:00,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:53:00,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,596 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-12 04:53:00,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:53:00,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:53:00,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:53:00,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:53:00,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (1/1) ... [2024-11-12 04:53:00,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:53:00,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:53:00,662 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-12 04:53:00,665 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-12 04:53:00,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:53:00,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:53:00,702 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:53:00,703 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:53:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:53:00,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:53:00,782 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:53:00,787 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:53:01,022 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 04:53:01,023 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:53:01,035 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:53:01,035 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:53:01,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:53:01 BoogieIcfgContainer [2024-11-12 04:53:01,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:53:01,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:53:01,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:53:01,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:53:01,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:53:00" (1/3) ... [2024-11-12 04:53:01,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20abc2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:53:01, skipping insertion in model container [2024-11-12 04:53:01,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:00" (2/3) ... [2024-11-12 04:53:01,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20abc2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:53:01, skipping insertion in model container [2024-11-12 04:53:01,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:53:01" (3/3) ... [2024-11-12 04:53:01,043 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-81.i [2024-11-12 04:53:01,055 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:53:01,055 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:53:01,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:53:01,116 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;@5ea1b3da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:53:01,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:53:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 04:53:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 04:53:01,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:53:01,132 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:53:01,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:53:01,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:53:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash 838936361, now seen corresponding path program 1 times [2024-11-12 04:53:01,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:53:01,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150948532] [2024-11-12 04:53:01,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:53:01,152 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-12 04:53:01,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:53:01,155 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-12 04:53:01,156 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-12 04:53:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:01,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:53:01,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:53:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-12 04:53:01,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:53:01,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:53:01,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150948532] [2024-11-12 04:53:01,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150948532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:53:01,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:53:01,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:53:01,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254068260] [2024-11-12 04:53:01,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:53:01,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:53:01,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:53:01,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:53:01,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:53:01,387 INFO L87 Difference]: Start difference. First operand has 60 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 04:53:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:53:01,407 INFO L93 Difference]: Finished difference Result 113 states and 196 transitions. [2024-11-12 04:53:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:53:01,409 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2024-11-12 04:53:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:53:01,414 INFO L225 Difference]: With dead ends: 113 [2024-11-12 04:53:01,414 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 04:53:01,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-12 04:53:01,419 INFO L435 NwaCegarLoop]: 83 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, 83 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-12 04:53:01,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:53:01,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 04:53:01,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-12 04:53:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 04:53:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2024-11-12 04:53:01,449 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 136 [2024-11-12 04:53:01,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:53:01,450 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2024-11-12 04:53:01,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 04:53:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2024-11-12 04:53:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 04:53:01,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:53:01,452 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:53:01,457 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-12 04:53:01,652 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-12 04:53:01,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:53:01,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:53:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2129204713, now seen corresponding path program 1 times [2024-11-12 04:53:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:53:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617212484] [2024-11-12 04:53:01,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:53:01,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:53:01,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:53:01,658 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-12 04:53:01,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:53:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:01,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 04:53:01,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:53:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 04:53:02,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:53:02,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:53:02,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617212484] [2024-11-12 04:53:02,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617212484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:53:02,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:53:02,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:53:02,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581443575] [2024-11-12 04:53:02,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:53:02,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:53:02,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:53:02,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:53:02,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:53:02,538 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 04:53:02,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:53:02,749 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2024-11-12 04:53:02,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:53:02,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-11-12 04:53:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:53:02,752 INFO L225 Difference]: With dead ends: 163 [2024-11-12 04:53:02,752 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 04:53:02,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:53:02,754 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 41 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:53:02,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 260 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:53:02,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 04:53:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2024-11-12 04:53:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 04:53:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2024-11-12 04:53:02,786 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 136 [2024-11-12 04:53:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:53:02,787 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2024-11-12 04:53:02,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 04:53:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2024-11-12 04:53:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 04:53:02,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:53:02,789 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 04:53:02,795 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-12 04:53:02,993 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-12 04:53:02,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:53:02,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:53:02,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1607383212, now seen corresponding path program 1 times [2024-11-12 04:53:02,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:53:02,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286779825] [2024-11-12 04:53:02,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:53:02,996 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-12 04:53:02,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:53:02,998 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-12 04:53:02,999 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-12 04:53:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:03,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 04:53:03,098 INFO L279 TraceCheckSpWp]: Computing forward predicates...