./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-47.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 5092b9874183dfc38681d21126dd96b4ef139ca1702e11549aa108a46ad20342 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:28:22,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:28:22,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:28:22,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:28:22,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:28:22,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:28:22,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:28:22,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:28:22,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:28:22,286 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:28:22,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:28:22,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:28:22,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:28:22,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:28:22,287 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:28:22,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:28:22,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:28:22,288 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:28:22,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:28:22,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:28:22,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:28:22,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:28:22,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:28:22,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:28:22,292 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:28:22,292 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:28:22,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:28:22,293 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:28:22,293 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:28:22,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:28:22,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:28:22,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:28:22,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:28:22,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:28:22,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:28:22,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:28:22,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:28:22,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:28:22,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:28:22,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:28:22,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:28:22,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:28:22,297 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 -> 5092b9874183dfc38681d21126dd96b4ef139ca1702e11549aa108a46ad20342 [2024-11-16 15:28:22,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:28:22,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:28:22,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:28:22,586 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:28:22,586 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:28:22,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-47.i [2024-11-16 15:28:24,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:28:24,332 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:28:24,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-47.i [2024-11-16 15:28:24,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e53b3bb64/37224140590e4f8c86e11b0c54550ade/FLAG4ae309fec [2024-11-16 15:28:24,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e53b3bb64/37224140590e4f8c86e11b0c54550ade [2024-11-16 15:28:24,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:28:24,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:28:24,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:28:24,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:28:24,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:28:24,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:28:24" (1/1) ... [2024-11-16 15:28:24,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19944852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:24, skipping insertion in model container [2024-11-16 15:28:24,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:28:24" (1/1) ... [2024-11-16 15:28:24,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:28:24,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-47.i[913,926] [2024-11-16 15:28:25,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:28:25,021 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:28:25,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-47.i[913,926] [2024-11-16 15:28:25,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:28:25,078 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:28:25,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25 WrapperNode [2024-11-16 15:28:25,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:28:25,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:28:25,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:28:25,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:28:25,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (1/1) ... [2024-11-16 15:28:25,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (1/1) ... [2024-11-16 15:28:25,159 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-11-16 15:28:25,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:28:25,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:28:25,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:28:25,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:28:25,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (1/1) ... [2024-11-16 15:28:25,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (1/1) ... [2024-11-16 15:28:25,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (1/1) ... [2024-11-16 15:28:25,224 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:28:25,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (1/1) ... [2024-11-16 15:28:25,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (1/1) ... [2024-11-16 15:28:25,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (1/1) ... [2024-11-16 15:28:25,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (1/1) ... [2024-11-16 15:28:25,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (1/1) ... [2024-11-16 15:28:25,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (1/1) ... [2024-11-16 15:28:25,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:28:25,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:28:25,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:28:25,271 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:28:25,272 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (1/1) ... [2024-11-16 15:28:25,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:28:25,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:28:25,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:28:25,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:28:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:28:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:28:25,347 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:28:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:28:25,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:28:25,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:28:25,421 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:28:25,423 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:28:25,774 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc property_#t~bitwise19#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1; [2024-11-16 15:28:25,828 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-16 15:28:25,828 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:28:25,864 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:28:25,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:28:25,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:28:25 BoogieIcfgContainer [2024-11-16 15:28:25,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:28:25,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:28:25,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:28:25,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:28:25,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:28:24" (1/3) ... [2024-11-16 15:28:25,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc7d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:28:25, skipping insertion in model container [2024-11-16 15:28:25,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:25" (2/3) ... [2024-11-16 15:28:25,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc7d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:28:25, skipping insertion in model container [2024-11-16 15:28:25,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:28:25" (3/3) ... [2024-11-16 15:28:25,877 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-47.i [2024-11-16 15:28:25,892 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:28:25,892 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:28:25,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:28:25,961 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;@36172449, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:28:25,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:28:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:28:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 15:28:25,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:28:25,978 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:28:25,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:28:25,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:28:25,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1566786296, now seen corresponding path program 1 times [2024-11-16 15:28:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:28:25,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231882919] [2024-11-16 15:28:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:28:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:28:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:28:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:28:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:28:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:28:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:28:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:28:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:28:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:28:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:28:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:28:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:28:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:28:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:28:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:28:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:28:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:28:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 15:28:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:28:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:28:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:28:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:28:26,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:28:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231882919] [2024-11-16 15:28:26,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231882919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:28:26,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:28:26,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:28:26,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944753905] [2024-11-16 15:28:26,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:28:26,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:28:26,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:28:26,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:28:26,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:28:26,501 INFO L87 Difference]: Start difference. First operand has 92 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:28:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:28:26,545 INFO L93 Difference]: Finished difference Result 176 states and 296 transitions. [2024-11-16 15:28:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:28:26,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 142 [2024-11-16 15:28:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:28:26,558 INFO L225 Difference]: With dead ends: 176 [2024-11-16 15:28:26,559 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 15:28:26,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:28:26,569 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:28:26,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:28:26,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 15:28:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-16 15:28:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:28:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-11-16 15:28:26,642 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 142 [2024-11-16 15:28:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:28:26,646 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-11-16 15:28:26,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:28:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-11-16 15:28:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 15:28:26,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:28:26,654 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:28:26,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:28:26,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:28:26,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:28:26,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1820222426, now seen corresponding path program 1 times [2024-11-16 15:28:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:28:26,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294813783] [2024-11-16 15:28:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:26,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:28:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:28:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:28:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:28:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:28:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:28:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:28:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:28:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:28:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:28:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:28:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:28:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:28:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:28:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:28:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:28:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:28:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:28:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 15:28:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:28:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:28:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:28:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:28:27,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:28:27,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294813783] [2024-11-16 15:28:27,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294813783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:28:27,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:28:27,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 15:28:27,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963030833] [2024-11-16 15:28:27,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:28:27,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:28:27,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:28:27,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:28:27,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:28:27,498 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:28:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:28:27,962 INFO L93 Difference]: Finished difference Result 374 states and 554 transitions. [2024-11-16 15:28:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 15:28:27,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-16 15:28:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:28:27,971 INFO L225 Difference]: With dead ends: 374 [2024-11-16 15:28:27,973 INFO L226 Difference]: Without dead ends: 290 [2024-11-16 15:28:27,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:28:27,975 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 299 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:28:27,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 501 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:28:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-16 15:28:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 180. [2024-11-16 15:28:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.362962962962963) internal successors, (184), 135 states have internal predecessors, (184), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 15:28:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 268 transitions. [2024-11-16 15:28:28,023 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 268 transitions. Word has length 143 [2024-11-16 15:28:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:28:28,025 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 268 transitions. [2024-11-16 15:28:28,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:28:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2024-11-16 15:28:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 15:28:28,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:28:28,032 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:28:28,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:28:28,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:28:28,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:28:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1411398201, now seen corresponding path program 1 times [2024-11-16 15:28:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:28:28,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815484713] [2024-11-16 15:28:28,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:28,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:28:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:28:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:28:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:28:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:28:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:28:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:28:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:28:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:28:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:28:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:28:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:28:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:28:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:28:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:28:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:28:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:28:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:28:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 15:28:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:28:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:28:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:28:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:28:28,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:28:28,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815484713] [2024-11-16 15:28:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815484713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:28:28,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:28:28,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:28:28,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598525051] [2024-11-16 15:28:28,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:28:28,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:28:28,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:28:28,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:28:28,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:28:28,775 INFO L87 Difference]: Start difference. First operand 180 states and 268 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:28:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:28:29,020 INFO L93 Difference]: Finished difference Result 350 states and 517 transitions. [2024-11-16 15:28:29,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:28:29,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-16 15:28:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:28:29,026 INFO L225 Difference]: With dead ends: 350 [2024-11-16 15:28:29,027 INFO L226 Difference]: Without dead ends: 173 [2024-11-16 15:28:29,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-16 15:28:29,029 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 91 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:28:29,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 339 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:28:29,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-16 15:28:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 140. [2024-11-16 15:28:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 95 states have internal predecessors, (122), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 15:28:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2024-11-16 15:28:29,070 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 143 [2024-11-16 15:28:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:28:29,071 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2024-11-16 15:28:29,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:28:29,071 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2024-11-16 15:28:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 15:28:29,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:28:29,076 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:28:29,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 15:28:29,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:28:29,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:28:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash -475465317, now seen corresponding path program 1 times [2024-11-16 15:28:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:28:29,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625916134] [2024-11-16 15:28:29,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:29,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:28:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:28:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:28:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:28:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:28:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:28:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:28:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:28:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:28:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:28:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:28:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:28:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:28:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:28:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:28:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:28:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:28:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:28:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 15:28:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:28:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:28:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:28:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:28:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:28:29,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625916134] [2024-11-16 15:28:29,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625916134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:28:29,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:28:29,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 15:28:29,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608495696] [2024-11-16 15:28:29,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:28:29,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:28:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:28:29,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:28:29,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:28:29,521 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:28:30,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:28:30,035 INFO L93 Difference]: Finished difference Result 407 states and 604 transitions. [2024-11-16 15:28:30,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 15:28:30,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2024-11-16 15:28:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:28:30,039 INFO L225 Difference]: With dead ends: 407 [2024-11-16 15:28:30,039 INFO L226 Difference]: Without dead ends: 323 [2024-11-16 15:28:30,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:28:30,041 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 165 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:28:30,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 525 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:28:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-16 15:28:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 263. [2024-11-16 15:28:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 196 states have (on average 1.3265306122448979) internal successors, (260), 196 states have internal predecessors, (260), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-16 15:28:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 386 transitions. [2024-11-16 15:28:30,087 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 386 transitions. Word has length 145 [2024-11-16 15:28:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:28:30,088 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 386 transitions. [2024-11-16 15:28:30,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:28:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 386 transitions. [2024-11-16 15:28:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 15:28:30,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:28:30,091 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:28:30,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 15:28:30,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:28:30,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:28:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash -389210351, now seen corresponding path program 1 times [2024-11-16 15:28:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:28:30,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153498005] [2024-11-16 15:28:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:30,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:28:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:28:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:28:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:28:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:28:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:28:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:28:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:28:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:28:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:28:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:28:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:28:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:28:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:28:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:28:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:28:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:28:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:28:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 15:28:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:28:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:28:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:28:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:28:30,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:28:30,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153498005] [2024-11-16 15:28:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153498005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:28:30,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:28:30,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 15:28:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803464328] [2024-11-16 15:28:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:28:30,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:28:30,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:28:30,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:28:30,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:28:30,508 INFO L87 Difference]: Start difference. First operand 263 states and 386 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:28:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:28:30,909 INFO L93 Difference]: Finished difference Result 730 states and 1079 transitions. [2024-11-16 15:28:30,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:28:30,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 146 [2024-11-16 15:28:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:28:30,914 INFO L225 Difference]: With dead ends: 730 [2024-11-16 15:28:30,914 INFO L226 Difference]: Without dead ends: 534 [2024-11-16 15:28:30,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:28:30,916 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 265 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:28:30,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 613 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:28:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-16 15:28:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 387. [2024-11-16 15:28:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 309 states have (on average 1.3527508090614886) internal successors, (418), 310 states have internal predecessors, (418), 73 states have call successors, (73), 4 states have call predecessors, (73), 4 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-16 15:28:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 564 transitions. [2024-11-16 15:28:30,990 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 564 transitions. Word has length 146 [2024-11-16 15:28:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:28:30,991 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 564 transitions. [2024-11-16 15:28:30,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:28:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 564 transitions. [2024-11-16 15:28:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 15:28:30,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:28:30,993 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:28:30,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 15:28:30,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:28:30,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:28:30,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1225385932, now seen corresponding path program 1 times [2024-11-16 15:28:30,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:28:30,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165825634] [2024-11-16 15:28:30,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:30,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:28:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:28:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:28:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:28:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:28:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:28:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:28:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:28:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:28:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:28:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:28:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:28:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:28:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:28:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:28:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:28:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:28:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:28:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 15:28:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:28:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:28:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:28:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 63 proven. 51 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-11-16 15:28:31,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:28:31,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165825634] [2024-11-16 15:28:31,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165825634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:28:31,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846206726] [2024-11-16 15:28:31,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:31,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:28:31,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:28:31,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:28:31,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 15:28:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:32,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 15:28:32,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:28:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 309 proven. 90 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-16 15:28:33,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:28:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 57 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2024-11-16 15:28:34,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846206726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:28:34,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 15:28:34,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 32 [2024-11-16 15:28:34,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764722468] [2024-11-16 15:28:34,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 15:28:34,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-16 15:28:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:28:34,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-16 15:28:34,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2024-11-16 15:28:34,688 INFO L87 Difference]: Start difference. First operand 387 states and 564 transitions. Second operand has 32 states, 30 states have (on average 4.366666666666666) internal successors, (131), 28 states have internal predecessors, (131), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) [2024-11-16 15:28:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:28:40,212 INFO L93 Difference]: Finished difference Result 1123 states and 1548 transitions. [2024-11-16 15:28:40,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-11-16 15:28:40,213 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 4.366666666666666) internal successors, (131), 28 states have internal predecessors, (131), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) Word has length 146 [2024-11-16 15:28:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:28:40,218 INFO L225 Difference]: With dead ends: 1123 [2024-11-16 15:28:40,220 INFO L226 Difference]: Without dead ends: 805 [2024-11-16 15:28:40,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4275 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2690, Invalid=9966, Unknown=0, NotChecked=0, Total=12656 [2024-11-16 15:28:40,226 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1093 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:28:40,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 1562 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-16 15:28:40,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-16 15:28:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 449. [2024-11-16 15:28:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 356 states have (on average 1.2949438202247192) internal successors, (461), 358 states have internal predecessors, (461), 75 states have call successors, (75), 17 states have call predecessors, (75), 17 states have return successors, (75), 73 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-16 15:28:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 611 transitions. [2024-11-16 15:28:40,302 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 611 transitions. Word has length 146 [2024-11-16 15:28:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:28:40,303 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 611 transitions. [2024-11-16 15:28:40,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 4.366666666666666) internal successors, (131), 28 states have internal predecessors, (131), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) [2024-11-16 15:28:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 611 transitions. [2024-11-16 15:28:40,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 15:28:40,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:28:40,306 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:28:40,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 15:28:40,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 15:28:40,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:28:40,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:28:40,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1128729508, now seen corresponding path program 1 times [2024-11-16 15:28:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:28:40,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040775941] [2024-11-16 15:28:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:28:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:28:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:28:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:28:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:28:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:28:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:28:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:28:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:28:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:28:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:28:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:28:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:28:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:28:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:28:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:28:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:28:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:28:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 15:28:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:28:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:28:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:28:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:28:40,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:28:40,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040775941] [2024-11-16 15:28:40,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040775941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:28:40,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:28:40,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:28:40,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765055021] [2024-11-16 15:28:40,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:28:40,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:28:40,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:28:40,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:28:40,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:28:40,704 INFO L87 Difference]: Start difference. First operand 449 states and 611 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:28:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:28:40,872 INFO L93 Difference]: Finished difference Result 973 states and 1321 transitions. [2024-11-16 15:28:40,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 15:28:40,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 147 [2024-11-16 15:28:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:28:40,879 INFO L225 Difference]: With dead ends: 973 [2024-11-16 15:28:40,879 INFO L226 Difference]: Without dead ends: 742 [2024-11-16 15:28:40,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-16 15:28:40,882 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 107 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:28:40,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 457 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:28:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-16 15:28:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 516. [2024-11-16 15:28:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 423 states have (on average 1.2789598108747045) internal successors, (541), 425 states have internal predecessors, (541), 75 states have call successors, (75), 17 states have call predecessors, (75), 17 states have return successors, (75), 73 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-16 15:28:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 691 transitions. [2024-11-16 15:28:40,949 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 691 transitions. Word has length 147 [2024-11-16 15:28:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:28:40,950 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 691 transitions. [2024-11-16 15:28:40,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:28:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 691 transitions. [2024-11-16 15:28:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 15:28:40,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:28:40,951 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:28:40,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 15:28:40,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:28:40,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:28:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash 563145600, now seen corresponding path program 1 times [2024-11-16 15:28:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:28:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997645377] [2024-11-16 15:28:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:28:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:28:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:28:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:28:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:28:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:28:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:28:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:28:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:28:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:28:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:28:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:28:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:28:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:28:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:28:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:28:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:28:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:28:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 15:28:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:28:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:28:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:28:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-16 15:28:41,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:28:41,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997645377] [2024-11-16 15:28:41,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997645377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:28:41,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318802836] [2024-11-16 15:28:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:41,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:28:41,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:28:41,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:28:41,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 15:28:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:41,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 15:28:41,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:28:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 188 proven. 102 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-16 15:28:42,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:28:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-16 15:28:42,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318802836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:28:42,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 15:28:42,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 18 [2024-11-16 15:28:42,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258690610] [2024-11-16 15:28:42,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 15:28:42,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 15:28:42,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:28:42,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 15:28:42,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-16 15:28:42,788 INFO L87 Difference]: Start difference. First operand 516 states and 691 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 17 states have internal predecessors, (102), 6 states have call successors, (60), 4 states have call predecessors, (60), 7 states have return successors, (61), 6 states have call predecessors, (61), 6 states have call successors, (61) [2024-11-16 15:28:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:28:43,444 INFO L93 Difference]: Finished difference Result 885 states and 1187 transitions. [2024-11-16 15:28:43,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 15:28:43,445 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 17 states have internal predecessors, (102), 6 states have call successors, (60), 4 states have call predecessors, (60), 7 states have return successors, (61), 6 states have call predecessors, (61), 6 states have call successors, (61) Word has length 147 [2024-11-16 15:28:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:28:43,448 INFO L225 Difference]: With dead ends: 885 [2024-11-16 15:28:43,448 INFO L226 Difference]: Without dead ends: 444 [2024-11-16 15:28:43,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2024-11-16 15:28:43,450 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 260 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 15:28:43,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1122 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 15:28:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-16 15:28:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 390. [2024-11-16 15:28:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 299 states have (on average 1.2441471571906355) internal successors, (372), 300 states have internal predecessors, (372), 73 states have call successors, (73), 17 states have call predecessors, (73), 17 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-16 15:28:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 518 transitions. [2024-11-16 15:28:43,506 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 518 transitions. Word has length 147 [2024-11-16 15:28:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:28:43,507 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 518 transitions. [2024-11-16 15:28:43,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 17 states have internal predecessors, (102), 6 states have call successors, (60), 4 states have call predecessors, (60), 7 states have return successors, (61), 6 states have call predecessors, (61), 6 states have call successors, (61) [2024-11-16 15:28:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 518 transitions. [2024-11-16 15:28:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 15:28:43,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:28:43,510 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:28:43,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 15:28:43,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-16 15:28:43,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:28:43,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:28:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash 6274959, now seen corresponding path program 1 times [2024-11-16 15:28:43,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:28:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682162034] [2024-11-16 15:28:43,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:28:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:28:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:28:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:28:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:28:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:28:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:28:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 15:28:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:28:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 15:28:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:28:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 15:28:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:28:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:28:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:28:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:28:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 15:28:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 15:28:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 15:28:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:28:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:28:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:28:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 66 proven. 96 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-16 15:28:44,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:28:44,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682162034] [2024-11-16 15:28:44,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682162034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:28:44,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287114378] [2024-11-16 15:28:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:44,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:28:44,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:28:44,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:28:44,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 15:28:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:44,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 15:28:44,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:28:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 309 proven. 90 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-16 15:28:45,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:28:46,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287114378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:28:46,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 15:28:46,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 20 [2024-11-16 15:28:46,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539029891] [2024-11-16 15:28:46,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 15:28:46,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 15:28:46,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:28:46,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 15:28:46,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2024-11-16 15:28:46,086 INFO L87 Difference]: Start difference. First operand 390 states and 518 transitions. Second operand has 20 states, 19 states have (on average 4.421052631578948) internal successors, (84), 17 states have internal predecessors, (84), 6 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (39), 8 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-16 15:28:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:28:47,681 INFO L93 Difference]: Finished difference Result 840 states and 1097 transitions. [2024-11-16 15:28:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-16 15:28:47,682 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.421052631578948) internal successors, (84), 17 states have internal predecessors, (84), 6 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (39), 8 states have call predecessors, (39), 6 states have call successors, (39) Word has length 148 [2024-11-16 15:28:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:28:47,685 INFO L225 Difference]: With dead ends: 840 [2024-11-16 15:28:47,685 INFO L226 Difference]: Without dead ends: 658 [2024-11-16 15:28:47,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=794, Invalid=2746, Unknown=0, NotChecked=0, Total=3540 [2024-11-16 15:28:47,687 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 564 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 15:28:47,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 810 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 15:28:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-16 15:28:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 433. [2024-11-16 15:28:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 339 states have (on average 1.2271386430678466) internal successors, (416), 340 states have internal predecessors, (416), 73 states have call successors, (73), 20 states have call predecessors, (73), 20 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-16 15:28:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 562 transitions. [2024-11-16 15:28:47,750 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 562 transitions. Word has length 148 [2024-11-16 15:28:47,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:28:47,751 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 562 transitions. [2024-11-16 15:28:47,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.421052631578948) internal successors, (84), 17 states have internal predecessors, (84), 6 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (39), 8 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-16 15:28:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 562 transitions. [2024-11-16 15:28:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 15:28:47,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:28:47,753 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:28:47,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 15:28:47,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:28:47,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:28:47,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:28:47,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1443940313, now seen corresponding path program 1 times [2024-11-16 15:28:47,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:28:47,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340693063] [2024-11-16 15:28:47,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:47,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:28:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:28:48,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [431470247] [2024-11-16 15:28:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:48,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:28:48,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:28:48,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:28:48,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 15:28:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:28:48,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 15:28:48,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:28:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-16 15:28:48,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:28:49,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:28:49,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340693063] [2024-11-16 15:28:49,208 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 15:28:49,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431470247] [2024-11-16 15:28:49,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431470247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:28:49,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 15:28:49,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-16 15:28:49,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817461119] [2024-11-16 15:28:49,209 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 15:28:49,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 15:28:49,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:28:49,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 15:28:49,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-16 15:28:49,210 INFO L87 Difference]: Start difference. First operand 433 states and 562 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:28:49,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:28:49,495 INFO L93 Difference]: Finished difference Result 794 states and 1034 transitions. [2024-11-16 15:28:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 15:28:49,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 148 [2024-11-16 15:28:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:28:49,499 INFO L225 Difference]: With dead ends: 794 [2024-11-16 15:28:49,500 INFO L226 Difference]: Without dead ends: 442 [2024-11-16 15:28:49,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-16 15:28:49,501 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 96 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:28:49,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 412 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 15:28:49,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-16 15:28:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 435. [2024-11-16 15:28:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 341 states have (on average 1.2258064516129032) internal successors, (418), 342 states have internal predecessors, (418), 73 states have call successors, (73), 20 states have call predecessors, (73), 20 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-16 15:28:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 564 transitions. [2024-11-16 15:28:49,560 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 564 transitions. Word has length 148 [2024-11-16 15:28:49,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:28:49,561 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 564 transitions. [2024-11-16 15:28:49,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:28:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 564 transitions. [2024-11-16 15:28:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 15:28:49,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:28:49,562 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:28:49,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 15:28:49,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:28:49,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:28:49,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:28:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1108216648, now seen corresponding path program 1 times [2024-11-16 15:28:49,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:28:49,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197800569] [2024-11-16 15:28:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:49,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:28:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:28:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084172919] [2024-11-16 15:28:49,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:28:49,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:28:49,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:28:49,823 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:28:49,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 15:28:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:28:50,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:28:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:28:50,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:28:50,278 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:28:50,279 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:28:50,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 15:28:50,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 15:28:50,485 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:28:50,589 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:28:50,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:28:50 BoogieIcfgContainer [2024-11-16 15:28:50,593 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:28:50,594 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:28:50,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:28:50,595 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:28:50,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:28:25" (3/4) ... [2024-11-16 15:28:50,598 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:28:50,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:28:50,599 INFO L158 Benchmark]: Toolchain (without parser) took 25912.95ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 84.5MB in the beginning and 273.2MB in the end (delta: -188.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:28:50,599 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 78.1MB in the end (delta: 108.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:28:50,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.54ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 67.8MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 15:28:50,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.97ms. Allocated memory is still 155.2MB. Free memory was 67.8MB in the beginning and 125.5MB in the end (delta: -57.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-16 15:28:50,600 INFO L158 Benchmark]: Boogie Preprocessor took 108.35ms. Allocated memory is still 155.2MB. Free memory was 125.5MB in the beginning and 119.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 15:28:50,600 INFO L158 Benchmark]: IcfgBuilder took 595.42ms. Allocated memory is still 155.2MB. Free memory was 119.3MB in the beginning and 89.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 15:28:50,601 INFO L158 Benchmark]: TraceAbstraction took 24726.40ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 89.2MB in the beginning and 273.2MB in the end (delta: -184.0MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-11-16 15:28:50,601 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 339.7MB. Free memory is still 273.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:28:50,602 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.22ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 78.1MB in the end (delta: 108.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.54ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 67.8MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.97ms. Allocated memory is still 155.2MB. Free memory was 67.8MB in the beginning and 125.5MB in the end (delta: -57.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.35ms. Allocated memory is still 155.2MB. Free memory was 125.5MB in the beginning and 119.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 595.42ms. Allocated memory is still 155.2MB. Free memory was 119.3MB in the beginning and 89.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24726.40ms. Allocated memory was 155.2MB in the beginning and 339.7MB in the end (delta: 184.5MB). Free memory was 89.2MB in the beginning and 273.2MB in the end (delta: -184.0MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 339.7MB. Free memory is still 273.2MB. 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 someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of bitwiseOr at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] unsigned char last_1_var_1_8 = 64; [L42] unsigned char last_1_var_1_19 = 1; [L43] unsigned short int last_1_var_1_20 = 256; [L44] unsigned long int last_1_var_1_22 = 64; VAL [isInitial=0, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L127] last_1_var_1_8 = var_1_8 [L128] last_1_var_1_19 = var_1_19 [L129] last_1_var_1_20 = var_1_20 [L130] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L93] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L94] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L94] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L95] var_1_4 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L96] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L98] var_1_5 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_6=10, var_1_8=64, var_1_9=5] [L99] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_6=10, var_1_8=64, var_1_9=5] [L100] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=10, var_1_8=64, var_1_9=5] [L101] var_1_6 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_8=64, var_1_9=5] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_8=64, var_1_9=5] [L103] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L103] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=5] [L104] var_1_9 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64] [L105] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64] [L106] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L107] var_1_11 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L108] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L110] var_1_13 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L111] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L112] var_1_14 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L113] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L114] var_1_15 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L116] var_1_17 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L117] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L122] var_1_21 = __VERIFIER_nondet_ushort() [L123] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L123] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L141] RET updateVariables() [L142] CALL step() [L48] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L49] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L53] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=16383, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L54] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L59] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=-65539, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L60] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L61] COND TRUE \read(var_1_16) [L62] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32830, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L69] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32830, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L70] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32830, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L76] COND TRUE var_1_12 >= (1.3 / var_1_3) [L77] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65405, var_1_20=32830, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L81] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65405, var_1_20=32830, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L82] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65405, var_1_20=32830, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L83] COND TRUE stepLocal_1 || var_1_16 [L84] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65405, var_1_20=32830, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65405, var_1_20=32830, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65405, var_1_20=32830, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L87] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65405, var_1_20=32830, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L133-L134] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65405, var_1_20=32830, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65405, var_1_20=32830, var_1_21=32767, var_1_22=64, var_1_4=-65539, var_1_5=16383, var_1_6=0, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.6s, OverallIterations: 11, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2953 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2940 mSDsluCounter, 6466 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4838 mSDsCounter, 850 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4978 IncrementalHoareTripleChecker+Invalid, 5828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 850 mSolverCounterUnsat, 1628 mSDtfsCounter, 4978 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1658 GetRequests, 1431 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5319 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=516occurred in iteration=7, InterpolantAutomatonStates: 196, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1218 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 2340 NumberOfCodeBlocks, 2340 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2174 ConstructedInterpolants, 0 QuantifiedInterpolants, 12927 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1341 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 11952/12600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 15:28:50,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-47.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 5092b9874183dfc38681d21126dd96b4ef139ca1702e11549aa108a46ad20342 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:28:52,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:28:52,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:28:52,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:28:52,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:28:52,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:28:52,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:28:52,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:28:52,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:28:52,975 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:28:52,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:28:52,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:28:52,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:28:52,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:28:52,977 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:28:52,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:28:52,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:28:52,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:28:52,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:28:52,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:28:52,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:28:52,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:28:52,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:28:52,983 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:28:52,983 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:28:52,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:28:52,984 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:28:52,984 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:28:52,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:28:52,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:28:52,985 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:28:52,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:28:52,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:28:52,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:28:52,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:28:52,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:28:52,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:28:52,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:28:52,988 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:28:52,989 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:28:52,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:28:52,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:28:52,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:28:52,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:28:52,993 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 -> 5092b9874183dfc38681d21126dd96b4ef139ca1702e11549aa108a46ad20342 [2024-11-16 15:28:53,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:28:53,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:28:53,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:28:53,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:28:53,337 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:28:53,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-47.i [2024-11-16 15:28:55,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:28:55,381 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:28:55,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-47.i [2024-11-16 15:28:55,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d7bddb5/3d30c979cd744a2e8bb583b5ff43e92b/FLAG9111864ce [2024-11-16 15:28:55,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d7bddb5/3d30c979cd744a2e8bb583b5ff43e92b [2024-11-16 15:28:55,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:28:55,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:28:55,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:28:55,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:28:55,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:28:55,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:55,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55, skipping insertion in model container [2024-11-16 15:28:55,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:55,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:28:55,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-47.i[913,926] [2024-11-16 15:28:55,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:28:55,788 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:28:55,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-47.i[913,926] [2024-11-16 15:28:55,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:28:55,872 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:28:55,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55 WrapperNode [2024-11-16 15:28:55,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:28:55,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:28:55,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:28:55,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:28:55,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:55,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:55,937 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-11-16 15:28:55,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:28:55,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:28:55,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:28:55,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:28:55,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:55,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:55,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:55,978 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:28:55,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:55,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:56,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:56,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:56,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:56,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:56,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:28:56,016 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:28:56,016 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:28:56,016 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:28:56,022 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (1/1) ... [2024-11-16 15:28:56,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:28:56,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:28:56,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:28:56,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:28:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:28:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:28:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:28:56,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:28:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:28:56,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:28:56,201 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:28:56,204 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:29:05,795 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 15:29:05,795 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:29:05,813 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:29:05,813 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:29:05,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:29:05 BoogieIcfgContainer [2024-11-16 15:29:05,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:29:05,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:29:05,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:29:05,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:29:05,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:28:55" (1/3) ... [2024-11-16 15:29:05,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce81c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:29:05, skipping insertion in model container [2024-11-16 15:29:05,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:28:55" (2/3) ... [2024-11-16 15:29:05,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce81c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:29:05, skipping insertion in model container [2024-11-16 15:29:05,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:29:05" (3/3) ... [2024-11-16 15:29:05,824 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-47.i [2024-11-16 15:29:05,845 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:29:05,845 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:29:05,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:29:05,921 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;@55551a61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:29:05,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:29:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:29:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 15:29:05,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:29:05,947 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:29:05,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:29:05,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:29:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1310560583, now seen corresponding path program 1 times [2024-11-16 15:29:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:29:05,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814767962] [2024-11-16 15:29:05,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:29:05,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:29:05,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:29:05,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:29:05,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 15:29:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:29:06,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:29:06,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:29:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-16 15:29:06,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:29:06,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:29:06,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814767962] [2024-11-16 15:29:06,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814767962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:29:06,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:29:06,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:29:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989574757] [2024-11-16 15:29:06,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:29:06,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:29:06,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:29:06,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:29:06,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:29:06,973 INFO L87 Difference]: Start difference. First operand has 69 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:29:06,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:29:06,998 INFO L93 Difference]: Finished difference Result 130 states and 220 transitions. [2024-11-16 15:29:07,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:29:07,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2024-11-16 15:29:07,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:29:07,008 INFO L225 Difference]: With dead ends: 130 [2024-11-16 15:29:07,008 INFO L226 Difference]: Without dead ends: 64 [2024-11-16 15:29:07,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:29:07,015 INFO L432 NwaCegarLoop]: 95 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, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:29:07,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:29:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-16 15:29:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-16 15:29:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:29:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-16 15:29:07,055 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 138 [2024-11-16 15:29:07,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:29:07,055 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-16 15:29:07,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:29:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-16 15:29:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 15:29:07,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:29:07,059 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:29:07,084 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-16 15:29:07,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:29:07,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:29:07,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:29:07,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1057708874, now seen corresponding path program 1 times [2024-11-16 15:29:07,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:29:07,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037939770] [2024-11-16 15:29:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:29:07,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:29:07,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:29:07,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:29:07,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 15:29:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:29:08,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 15:29:08,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:29:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-16 15:29:10,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:29:11,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:29:11,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037939770] [2024-11-16 15:29:11,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037939770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:29:11,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1470517121] [2024-11-16 15:29:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:29:11,200 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 15:29:11,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 15:29:11,204 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 15:29:11,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-16 15:29:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:29:12,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 15:29:12,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:29:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:29:15,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:29:15,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1470517121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:29:15,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 15:29:15,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-16 15:29:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979743237] [2024-11-16 15:29:15,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:29:15,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:29:15,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:29:15,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:29:15,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-16 15:29:15,859 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:29:20,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:29:24,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:29:28,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:29:32,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:29:37,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:29:37,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:29:37,199 INFO L93 Difference]: Finished difference Result 298 states and 444 transitions. [2024-11-16 15:29:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:29:37,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 138 [2024-11-16 15:29:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:29:37,205 INFO L225 Difference]: With dead ends: 298 [2024-11-16 15:29:37,206 INFO L226 Difference]: Without dead ends: 237 [2024-11-16 15:29:37,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-16 15:29:37,208 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 234 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 133 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2024-11-16 15:29:37,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 483 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 34 Invalid, 4 Unknown, 0 Unchecked, 20.9s Time] [2024-11-16 15:29:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-16 15:29:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2024-11-16 15:29:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 15:29:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-11-16 15:29:37,263 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 138 [2024-11-16 15:29:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:29:37,265 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-11-16 15:29:37,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:29:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-11-16 15:29:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 15:29:37,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:29:37,271 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:29:37,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-16 15:29:37,492 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-16 15:29:37,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:29:37,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:29:37,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:29:37,673 INFO L85 PathProgramCache]: Analyzing trace with hash 449842935, now seen corresponding path program 1 times [2024-11-16 15:29:37,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:29:37,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752755561] [2024-11-16 15:29:37,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:29:37,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:29:37,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:29:37,678 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:29:37,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 15:29:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:29:38,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 15:29:38,410 INFO L278 TraceCheckSpWp]: Computing forward predicates...