./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.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_filler-pe-ci_file-13.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 8d4109ae03a3c02a4964ae7b090d66bce817f303884ee31660fd67b3b1f99877 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:46:39,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:46:39,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:46:39,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:46:39,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:46:39,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:46:39,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:46:39,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:46:39,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:46:39,975 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:46:39,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:46:39,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:46:39,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:46:39,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:46:39,976 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:46:39,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:46:39,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:46:39,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:46:39,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:46:39,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:46:39,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:46:39,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:46:39,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:46:39,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:46:39,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:46:39,982 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:46:39,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:46:39,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:46:39,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:46:39,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:46:39,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:46:39,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:46:39,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:46:39,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:46:39,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:46:39,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:46:39,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:46:39,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:46:39,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:46:39,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:46:39,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:46:39,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:46:39,988 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 -> 8d4109ae03a3c02a4964ae7b090d66bce817f303884ee31660fd67b3b1f99877 [2024-11-16 13:46:40,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:46:40,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:46:40,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:46:40,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:46:40,230 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:46:40,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i [2024-11-16 13:46:41,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:46:41,592 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:46:41,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i [2024-11-16 13:46:41,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea095f953/106e7fa93e674d31aa1c1995c1fcb137/FLAGbde690f37 [2024-11-16 13:46:42,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea095f953/106e7fa93e674d31aa1c1995c1fcb137 [2024-11-16 13:46:42,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:46:42,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:46:42,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:46:42,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:46:42,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:46:42,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2396e0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42, skipping insertion in model container [2024-11-16 13:46:42,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:46:42,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i[919,932] [2024-11-16 13:46:42,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:46:42,231 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:46:42,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i[919,932] [2024-11-16 13:46:42,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:46:42,300 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:46:42,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42 WrapperNode [2024-11-16 13:46:42,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:46:42,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:46:42,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:46:42,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:46:42,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,351 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-16 13:46:42,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:46:42,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:46:42,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:46:42,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:46:42,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,398 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 13:46:42,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,412 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:46:42,438 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:46:42,438 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:46:42,438 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:46:42,439 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (1/1) ... [2024-11-16 13:46:42,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:46:42,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:46:42,470 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 13:46:42,472 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 13:46:42,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:46:42,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:46:42,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:46:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:46:42,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:46:42,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:46:42,625 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:46:42,627 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:46:42,896 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L165: havoc property_#t~bitwise18#1; [2024-11-16 13:46:42,924 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 13:46:42,925 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:46:42,942 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:46:42,944 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:46:42,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:46:42 BoogieIcfgContainer [2024-11-16 13:46:42,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:46:42,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:46:42,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:46:42,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:46:42,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:46:42" (1/3) ... [2024-11-16 13:46:42,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3bc6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:46:42, skipping insertion in model container [2024-11-16 13:46:42,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:46:42" (2/3) ... [2024-11-16 13:46:42,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3bc6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:46:42, skipping insertion in model container [2024-11-16 13:46:42,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:46:42" (3/3) ... [2024-11-16 13:46:42,952 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i [2024-11-16 13:46:42,964 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:46:42,964 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:46:43,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:46:43,009 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;@fe1b907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:46:43,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:46:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 13:46:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 13:46:43,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:46:43,022 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:43,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:46:43,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:46:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1935628575, now seen corresponding path program 1 times [2024-11-16 13:46:43,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:46:43,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955016808] [2024-11-16 13:46:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:46:43,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:46:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:46:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:46:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:46:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:46:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:46:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:46:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:46:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:46:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:46:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:46:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:46:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:46:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:46:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:46:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:46:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:46:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:46:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:46:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:46:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:46:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:46:43,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:46:43,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955016808] [2024-11-16 13:46:43,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955016808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:46:43,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:46:43,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:46:43,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019822171] [2024-11-16 13:46:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:46:43,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:46:43,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:46:43,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:46:43,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:46:43,384 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 13:46:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:46:43,432 INFO L93 Difference]: Finished difference Result 166 states and 279 transitions. [2024-11-16 13:46:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:46:43,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2024-11-16 13:46:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:46:43,440 INFO L225 Difference]: With dead ends: 166 [2024-11-16 13:46:43,441 INFO L226 Difference]: Without dead ends: 82 [2024-11-16 13:46:43,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 13:46:43,449 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:46:43,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:46:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-16 13:46:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-16 13:46:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 13:46:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 123 transitions. [2024-11-16 13:46:43,494 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 123 transitions. Word has length 143 [2024-11-16 13:46:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:46:43,495 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 123 transitions. [2024-11-16 13:46:43,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 13:46:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 123 transitions. [2024-11-16 13:46:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 13:46:43,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:46:43,500 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:43,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:46:43,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:46:43,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:46:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1790905445, now seen corresponding path program 1 times [2024-11-16 13:46:43,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:46:43,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218107710] [2024-11-16 13:46:43,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:46:43,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:46:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:46:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:46:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:46:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:46:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:46:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:46:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:46:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:46:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:46:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:46:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:46:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:46:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:46:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:46:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:46:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:46:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:46:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:46:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:46:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:46:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:46:43,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:46:43,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218107710] [2024-11-16 13:46:43,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218107710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:46:43,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:46:43,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:46:43,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968453685] [2024-11-16 13:46:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:46:43,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:46:43,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:46:43,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:46:43,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:46:43,787 INFO L87 Difference]: Start difference. First operand 82 states and 123 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:46:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:46:43,857 INFO L93 Difference]: Finished difference Result 212 states and 317 transitions. [2024-11-16 13:46:43,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:46:43,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-16 13:46:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:46:43,859 INFO L225 Difference]: With dead ends: 212 [2024-11-16 13:46:43,859 INFO L226 Difference]: Without dead ends: 133 [2024-11-16 13:46:43,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:46:43,861 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 64 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:46:43,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 281 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:46:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-16 13:46:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2024-11-16 13:46:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 100 states have (on average 1.4) internal successors, (140), 101 states have internal predecessors, (140), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 13:46:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 192 transitions. [2024-11-16 13:46:43,878 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 192 transitions. Word has length 143 [2024-11-16 13:46:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:46:43,879 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 192 transitions. [2024-11-16 13:46:43,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:46:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2024-11-16 13:46:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 13:46:43,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:46:43,881 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:43,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:46:43,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:46:43,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:46:43,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1259297370, now seen corresponding path program 1 times [2024-11-16 13:46:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:46:43,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452108392] [2024-11-16 13:46:43,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:46:43,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:46:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:46:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:46:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:46:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:46:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:46:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:46:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:46:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:46:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:46:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:46:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:46:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:46:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:46:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:46:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:46:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:46:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:46:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:46:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:46:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:46:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:46:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:46:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452108392] [2024-11-16 13:46:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452108392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:46:44,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:46:44,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 13:46:44,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976452911] [2024-11-16 13:46:44,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:46:44,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 13:46:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:46:44,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 13:46:44,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:46:44,467 INFO L87 Difference]: Start difference. First operand 129 states and 192 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:46:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:46:44,800 INFO L93 Difference]: Finished difference Result 371 states and 556 transitions. [2024-11-16 13:46:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 13:46:44,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-16 13:46:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:46:44,804 INFO L225 Difference]: With dead ends: 371 [2024-11-16 13:46:44,804 INFO L226 Difference]: Without dead ends: 245 [2024-11-16 13:46:44,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 13:46:44,808 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 104 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:46:44,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 459 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:46:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-16 13:46:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 170. [2024-11-16 13:46:44,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 121 states have internal predecessors, (161), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 13:46:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2024-11-16 13:46:44,844 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 143 [2024-11-16 13:46:44,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:46:44,844 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 253 transitions. [2024-11-16 13:46:44,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:46:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 253 transitions. [2024-11-16 13:46:44,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 13:46:44,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:46:44,846 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:44,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 13:46:44,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:46:44,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:46:44,846 INFO L85 PathProgramCache]: Analyzing trace with hash -420684828, now seen corresponding path program 1 times [2024-11-16 13:46:44,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:46:44,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629225429] [2024-11-16 13:46:44,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:46:44,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:46:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:46:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:46:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:46:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:46:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:46:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:46:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:46:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:46:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:46:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:44,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:46:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:46:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:46:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:46:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:46:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:46:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:46:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:46:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:46:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:46:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:46:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:46:45,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:46:45,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629225429] [2024-11-16 13:46:45,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629225429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:46:45,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:46:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:46:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376754301] [2024-11-16 13:46:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:46:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:46:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:46:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:46:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:46:45,030 INFO L87 Difference]: Start difference. First operand 170 states and 253 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:46:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:46:45,193 INFO L93 Difference]: Finished difference Result 489 states and 729 transitions. [2024-11-16 13:46:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:46:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-16 13:46:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:46:45,196 INFO L225 Difference]: With dead ends: 489 [2024-11-16 13:46:45,196 INFO L226 Difference]: Without dead ends: 363 [2024-11-16 13:46:45,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:46:45,197 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 114 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:46:45,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 278 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:46:45,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-16 13:46:45,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 331. [2024-11-16 13:46:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 253 states have (on average 1.3992094861660078) internal successors, (354), 255 states have internal predecessors, (354), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 13:46:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 498 transitions. [2024-11-16 13:46:45,230 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 498 transitions. Word has length 144 [2024-11-16 13:46:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:46:45,230 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 498 transitions. [2024-11-16 13:46:45,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:46:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 498 transitions. [2024-11-16 13:46:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 13:46:45,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:46:45,233 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:45,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 13:46:45,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:46:45,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:46:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash 748113475, now seen corresponding path program 1 times [2024-11-16 13:46:45,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:46:45,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803036888] [2024-11-16 13:46:45,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:46:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:46:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:46:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:46:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:46:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:46:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:46:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:46:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:46:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:46:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:46:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:46:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:46:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:46:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:46:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:46:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:46:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:46:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:46:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:46:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:46:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:46:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:46:45,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:46:45,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803036888] [2024-11-16 13:46:45,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803036888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:46:45,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:46:45,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:46:45,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185914889] [2024-11-16 13:46:45,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:46:45,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:46:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:46:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:46:45,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:46:45,421 INFO L87 Difference]: Start difference. First operand 331 states and 498 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:46:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:46:45,589 INFO L93 Difference]: Finished difference Result 771 states and 1160 transitions. [2024-11-16 13:46:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:46:45,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-16 13:46:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:46:45,593 INFO L225 Difference]: With dead ends: 771 [2024-11-16 13:46:45,594 INFO L226 Difference]: Without dead ends: 484 [2024-11-16 13:46:45,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:46:45,597 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 141 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:46:45,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 184 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:46:45,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-16 13:46:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 341. [2024-11-16 13:46:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 263 states have (on average 1.391634980988593) internal successors, (366), 265 states have internal predecessors, (366), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 13:46:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 510 transitions. [2024-11-16 13:46:45,632 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 510 transitions. Word has length 145 [2024-11-16 13:46:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:46:45,633 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 510 transitions. [2024-11-16 13:46:45,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:46:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 510 transitions. [2024-11-16 13:46:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 13:46:45,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:46:45,634 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:45,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 13:46:45,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:46:45,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:46:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1289942814, now seen corresponding path program 1 times [2024-11-16 13:46:45,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:46:45,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166388260] [2024-11-16 13:46:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:46:45,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:46:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:46:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:46:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:46:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:46:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:46:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:46:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:46:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:46:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:46:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:46:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:46:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:46:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:46:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:46:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:46:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:46:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:46:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:46:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:46:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:46:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 13:46:46,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:46:46,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166388260] [2024-11-16 13:46:46,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166388260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:46:46,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290455968] [2024-11-16 13:46:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:46:46,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:46:46,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:46:46,296 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 13:46:46,297 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 13:46:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:46,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 13:46:46,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:46:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 465 proven. 99 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-16 13:46:47,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:46:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 84 proven. 27 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-16 13:46:47,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290455968] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:46:47,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 13:46:47,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 10] total 28 [2024-11-16 13:46:47,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475013298] [2024-11-16 13:46:47,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 13:46:47,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-16 13:46:47,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:46:47,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-16 13:46:47,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2024-11-16 13:46:47,886 INFO L87 Difference]: Start difference. First operand 341 states and 510 transitions. Second operand has 28 states, 26 states have (on average 4.730769230769231) internal successors, (123), 25 states have internal predecessors, (123), 9 states have call successors, (35), 5 states have call predecessors, (35), 9 states have return successors, (37), 8 states have call predecessors, (37), 9 states have call successors, (37) [2024-11-16 13:46:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:46:50,390 INFO L93 Difference]: Finished difference Result 708 states and 985 transitions. [2024-11-16 13:46:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-16 13:46:50,391 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.730769230769231) internal successors, (123), 25 states have internal predecessors, (123), 9 states have call successors, (35), 5 states have call predecessors, (35), 9 states have return successors, (37), 8 states have call predecessors, (37), 9 states have call successors, (37) Word has length 145 [2024-11-16 13:46:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:46:50,393 INFO L225 Difference]: With dead ends: 708 [2024-11-16 13:46:50,394 INFO L226 Difference]: Without dead ends: 577 [2024-11-16 13:46:50,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1513, Invalid=4187, Unknown=0, NotChecked=0, Total=5700 [2024-11-16 13:46:50,398 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 776 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:46:50,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 790 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 13:46:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-16 13:46:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 501. [2024-11-16 13:46:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 386 states have (on average 1.3264248704663213) internal successors, (512), 390 states have internal predecessors, (512), 88 states have call successors, (88), 26 states have call predecessors, (88), 26 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-16 13:46:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 688 transitions. [2024-11-16 13:46:50,454 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 688 transitions. Word has length 145 [2024-11-16 13:46:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:46:50,455 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 688 transitions. [2024-11-16 13:46:50,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.730769230769231) internal successors, (123), 25 states have internal predecessors, (123), 9 states have call successors, (35), 5 states have call predecessors, (35), 9 states have return successors, (37), 8 states have call predecessors, (37), 9 states have call successors, (37) [2024-11-16 13:46:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 688 transitions. [2024-11-16 13:46:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 13:46:50,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:46:50,457 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:50,475 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 13:46:50,657 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 13:46:50,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:46:50,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:46:50,658 INFO L85 PathProgramCache]: Analyzing trace with hash 173321388, now seen corresponding path program 1 times [2024-11-16 13:46:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:46:50,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53152191] [2024-11-16 13:46:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:46:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:46:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:46:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:46:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:46:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:46:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:46:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:46:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:46:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:46:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:46:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:46:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:46:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 13:46:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:46:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 13:46:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:46:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 13:46:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:46:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:46:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:46:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:46:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 13:46:50,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:46:50,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53152191] [2024-11-16 13:46:50,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53152191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:46:50,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72474923] [2024-11-16 13:46:50,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:46:50,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:46:50,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:46:50,970 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 13:46:50,971 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 13:46:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:51,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 13:46:51,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:46:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 417 proven. 78 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-16 13:46:51,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:46:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-16 13:46:51,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72474923] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:46:51,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 13:46:51,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-16 13:46:51,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362566343] [2024-11-16 13:46:51,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 13:46:51,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 13:46:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:46:51,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 13:46:51,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-11-16 13:46:51,717 INFO L87 Difference]: Start difference. First operand 501 states and 688 transitions. Second operand has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 7 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 7 states have call predecessors, (59), 7 states have call successors, (59) [2024-11-16 13:46:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:46:52,524 INFO L93 Difference]: Finished difference Result 1393 states and 1913 transitions. [2024-11-16 13:46:52,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-16 13:46:52,526 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 7 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 7 states have call predecessors, (59), 7 states have call successors, (59) Word has length 146 [2024-11-16 13:46:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:46:52,531 INFO L225 Difference]: With dead ends: 1393 [2024-11-16 13:46:52,531 INFO L226 Difference]: Without dead ends: 956 [2024-11-16 13:46:52,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=385, Invalid=1097, Unknown=0, NotChecked=0, Total=1482 [2024-11-16 13:46:52,533 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 382 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 13:46:52,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 387 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 13:46:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-16 13:46:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 433. [2024-11-16 13:46:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 331 states have (on average 1.256797583081571) internal successors, (416), 333 states have internal predecessors, (416), 72 states have call successors, (72), 29 states have call predecessors, (72), 29 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 13:46:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 560 transitions. [2024-11-16 13:46:52,575 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 560 transitions. Word has length 146 [2024-11-16 13:46:52,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:46:52,576 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 560 transitions. [2024-11-16 13:46:52,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 7 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 7 states have call predecessors, (59), 7 states have call successors, (59) [2024-11-16 13:46:52,576 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 560 transitions. [2024-11-16 13:46:52,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 13:46:52,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:46:52,577 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:52,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 13:46:52,778 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,SelfDestructingSolverStorable6 [2024-11-16 13:46:52,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:46:52,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:46:52,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1803009442, now seen corresponding path program 1 times [2024-11-16 13:46:52,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:46:52,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578703802] [2024-11-16 13:46:52,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:46:52,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:46:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:46:52,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434504246] [2024-11-16 13:46:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:46:52,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:46:52,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:46:52,827 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 13:46:52,828 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 13:46:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:46:53,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 13:46:53,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:46:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 438 proven. 57 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-16 13:46:53,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:47:10,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:47:10,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578703802] [2024-11-16 13:47:10,366 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 13:47:10,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434504246] [2024-11-16 13:47:10,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434504246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:47:10,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 13:47:10,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-11-16 13:47:10,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395517416] [2024-11-16 13:47:10,367 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 13:47:10,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 13:47:10,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:47:10,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 13:47:10,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=57, Unknown=3, NotChecked=0, Total=90 [2024-11-16 13:47:10,368 INFO L87 Difference]: Start difference. First operand 433 states and 560 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-16 13:47:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:47:19,048 INFO L93 Difference]: Finished difference Result 832 states and 1066 transitions. [2024-11-16 13:47:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 13:47:19,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 147 [2024-11-16 13:47:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:47:19,051 INFO L225 Difference]: With dead ends: 832 [2024-11-16 13:47:19,051 INFO L226 Difference]: Without dead ends: 467 [2024-11-16 13:47:19,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=58, Invalid=95, Unknown=3, NotChecked=0, Total=156 [2024-11-16 13:47:19,052 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 108 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-16 13:47:19,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 230 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-16 13:47:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-16 13:47:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 457. [2024-11-16 13:47:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 349 states have (on average 1.2263610315186246) internal successors, (428), 351 states have internal predecessors, (428), 72 states have call successors, (72), 35 states have call predecessors, (72), 35 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 13:47:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 572 transitions. [2024-11-16 13:47:19,096 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 572 transitions. Word has length 147 [2024-11-16 13:47:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:47:19,096 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 572 transitions. [2024-11-16 13:47:19,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-16 13:47:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 572 transitions. [2024-11-16 13:47:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 13:47:19,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:47:19,098 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:47:19,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 13:47:19,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:47:19,299 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:47:19,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:47:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1406826681, now seen corresponding path program 1 times [2024-11-16 13:47:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:47:19,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607310221] [2024-11-16 13:47:19,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:47:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:47:19,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1997213813] [2024-11-16 13:47:19,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:19,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:47:19,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:47:19,352 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 13:47:19,353 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 13:47:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:47:19,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:47:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:47:19,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:47:19,565 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:47:19,566 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:47:19,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 13:47:19,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:47:19,771 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:47:19,869 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:47:19,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:47:19 BoogieIcfgContainer [2024-11-16 13:47:19,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:47:19,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:47:19,872 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:47:19,872 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:47:19,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:46:42" (3/4) ... [2024-11-16 13:47:19,874 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:47:19,875 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:47:19,875 INFO L158 Benchmark]: Toolchain (without parser) took 37862.65ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 140.4MB in the beginning and 288.4MB in the end (delta: -148.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:47:19,875 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory was 67.3MB in the beginning and 67.3MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:47:19,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.34ms. Allocated memory is still 192.9MB. Free memory was 139.8MB in the beginning and 122.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 13:47:19,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.58ms. Allocated memory is still 192.9MB. Free memory was 122.3MB in the beginning and 117.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:47:19,876 INFO L158 Benchmark]: Boogie Preprocessor took 81.55ms. Allocated memory is still 192.9MB. Free memory was 117.5MB in the beginning and 158.7MB in the end (delta: -41.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-16 13:47:19,876 INFO L158 Benchmark]: IcfgBuilder took 506.75ms. Allocated memory is still 192.9MB. Free memory was 158.7MB in the beginning and 135.2MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 13:47:19,876 INFO L158 Benchmark]: TraceAbstraction took 36924.61ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 134.3MB in the beginning and 288.4MB in the end (delta: -154.1MB). Peak memory consumption was 182.1MB. Max. memory is 16.1GB. [2024-11-16 13:47:19,876 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 337.6MB. Free memory is still 288.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:47:19,877 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory was 67.3MB in the beginning and 67.3MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.34ms. Allocated memory is still 192.9MB. Free memory was 139.8MB in the beginning and 122.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.58ms. Allocated memory is still 192.9MB. Free memory was 122.3MB in the beginning and 117.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.55ms. Allocated memory is still 192.9MB. Free memory was 117.5MB in the beginning and 158.7MB in the end (delta: -41.2MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * IcfgBuilder took 506.75ms. Allocated memory is still 192.9MB. Free memory was 158.7MB in the beginning and 135.2MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 36924.61ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 134.3MB in the beginning and 288.4MB in the end (delta: -154.1MB). Peak memory consumption was 182.1MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 337.6MB. Free memory is still 288.4MB. 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 165, overapproximation of someUnaryDOUBLEoperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] double var_1_25 = 0.75; [L43] unsigned char var_1_27 = 4; [L44] signed short int var_1_35 = -64; [L45] signed char var_1_36 = -10; [L46] signed long int var_1_39 = 256; [L47] double var_1_40 = 31.6; [L48] signed short int var_1_42 = 5; [L49] signed short int last_1_var_1_21 = -64; [L50] unsigned char last_1_var_1_22 = 25; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L169] isInitial = 1 [L170] FCALL initially() [L171] COND TRUE 1 [L172] CALL updateLastVariables() [L161] last_1_var_1_21 = var_1_21 [L162] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L172] RET updateLastVariables() [L173] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L128] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L129] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L129] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L130] var_1_5 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L131] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L132] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L133] var_1_6 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L134] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L135] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L136] var_1_9 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L137] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L142] var_1_11 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L143] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L145] var_1_13 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L146] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L148] var_1_14 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L149] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L150] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L151] var_1_17 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L152] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L153] var_1_18 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L154] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L155] var_1_19 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L156] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L157] var_1_20 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L158] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L173] RET updateVariables() [L174] CALL step() [L54] signed long int stepLocal_1 = ~ last_1_var_1_21; [L55] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L56] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L56] COND TRUE stepLocal_1 != (last_1_var_1_22 >> var_1_4) [L57] COND TRUE stepLocal_0 || var_1_6 [L58] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L65] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L68] unsigned short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_3=0, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L69] COND FALSE !(var_1_4 > stepLocal_3) [L72] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L74] COND TRUE ((- var_1_11) < 8) || var_1_9 [L75] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L77] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L78] COND TRUE var_1_18 <= var_1_20 [L79] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L85] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L90] signed short int stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_2=-64, var_1_10=127, var_1_11=127, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L91] COND TRUE var_1_10 > stepLocal_2 [L92] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L94] var_1_25 = var_1_19 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L95] COND FALSE !((var_1_20 >= var_1_18) && (var_1_11 >= var_1_22)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L102] COND FALSE !(var_1_20 > var_1_18) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L107] COND TRUE var_1_11 >= (var_1_11 % ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L108] COND FALSE !(var_1_11 < var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L114] COND FALSE !(var_1_1 > var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L117] COND FALSE !(var_1_21 < ((((var_1_4) < (-64)) ? (var_1_4) : (-64)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L120] EXPR var_1_11 | var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L120] COND TRUE (var_1_11 | var_1_4) < (8 + var_1_11) [L121] var_1_40 = (((((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_19)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_19))) < 0 ) ? -((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_19)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_19))) : ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_19)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_19))))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_18=0, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=4, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L124] var_1_42 = var_1_22 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_18=0, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=4, var_1_42=127, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L174] RET step() [L175] CALL, EXPR property() [L165] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_18=0, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=4, var_1_42=127, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L165-L166] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L175] RET, EXPR property() [L175] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_18=0, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=4, var_1_42=127, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_18=0, var_1_19=3, var_1_1=0, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_25=3, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=4, var_1_42=127, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.8s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1699 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1689 mSDsluCounter, 2729 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1842 mSDsCounter, 557 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2631 IncrementalHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 557 mSolverCounterUnsat, 887 mSDtfsCounter, 2631 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1229 GetRequests, 1093 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 20.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=501occurred in iteration=6, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 863 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 1890 NumberOfCodeBlocks, 1890 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1726 ConstructedInterpolants, 0 QuantifiedInterpolants, 8819 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1053 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 8736/9120 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 13:47:20,089 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-16 13:47:20,290 FATAL L548 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Could not destroy process within 200 ms, abandoning it Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.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 8d4109ae03a3c02a4964ae7b090d66bce817f303884ee31660fd67b3b1f99877 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:47:21,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:47:21,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:47:21,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:47:21,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:47:21,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:47:21,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:47:21,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:47:21,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:47:21,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:47:21,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:47:21,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:47:21,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:47:21,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:47:21,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:47:21,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:47:21,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:47:21,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:47:21,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:47:21,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:47:21,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:47:21,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:47:21,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:47:21,899 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:47:21,900 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:47:21,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:47:21,900 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:47:21,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:47:21,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:47:21,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:47:21,901 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:47:21,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:47:21,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:47:21,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:47:21,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:47:21,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:47:21,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:47:21,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:47:21,902 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:47:21,902 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:47:21,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:47:21,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:47:21,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:47:21,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:47:21,903 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 -> 8d4109ae03a3c02a4964ae7b090d66bce817f303884ee31660fd67b3b1f99877 [2024-11-16 13:47:22,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:47:22,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:47:22,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:47:22,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:47:22,160 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:47:22,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i [2024-11-16 13:47:23,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:47:23,606 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:47:23,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i [2024-11-16 13:47:23,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc080d0f9/2deb06cccfcf4ffca4ccf0d30298a8f9/FLAG039225ee7 [2024-11-16 13:47:23,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc080d0f9/2deb06cccfcf4ffca4ccf0d30298a8f9 [2024-11-16 13:47:24,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:47:24,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:47:24,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:47:24,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:47:24,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:47:24,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df9fa28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24, skipping insertion in model container [2024-11-16 13:47:24,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:47:24,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i[919,932] [2024-11-16 13:47:24,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:47:24,266 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:47:24,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i[919,932] [2024-11-16 13:47:24,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:47:24,351 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:47:24,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24 WrapperNode [2024-11-16 13:47:24,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:47:24,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:47:24,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:47:24,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:47:24,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,404 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-11-16 13:47:24,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:47:24,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:47:24,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:47:24,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:47:24,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,438 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 13:47:24,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:47:24,464 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:47:24,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:47:24,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:47:24,465 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (1/1) ... [2024-11-16 13:47:24,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:47:24,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:47:24,495 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 13:47:24,498 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 13:47:24,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:47:24,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:47:24,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:47:24,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:47:24,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:47:24,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:47:24,594 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:47:24,596 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:47:28,122 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 13:47:28,123 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:47:28,133 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:47:28,133 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:47:28,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:47:28 BoogieIcfgContainer [2024-11-16 13:47:28,134 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:47:28,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:47:28,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:47:28,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:47:28,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:47:24" (1/3) ... [2024-11-16 13:47:28,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea9c12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:47:28, skipping insertion in model container [2024-11-16 13:47:28,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:24" (2/3) ... [2024-11-16 13:47:28,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea9c12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:47:28, skipping insertion in model container [2024-11-16 13:47:28,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:47:28" (3/3) ... [2024-11-16 13:47:28,139 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-13.i [2024-11-16 13:47:28,150 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:47:28,150 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:47:28,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:47:28,205 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;@3fc7abfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:47:28,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:47:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 13:47:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 13:47:28,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:47:28,218 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:47:28,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:47:28,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:47:28,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1659142065, now seen corresponding path program 1 times [2024-11-16 13:47:28,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:47:28,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760852556] [2024-11-16 13:47:28,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:28,235 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 13:47:28,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:47:28,238 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 13:47:28,240 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 13:47:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:28,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:47:28,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:47:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-16 13:47:28,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:47:28,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:47:28,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760852556] [2024-11-16 13:47:28,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760852556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:47:28,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:47:28,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:47:28,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490412041] [2024-11-16 13:47:28,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:47:28,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:47:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:47:28,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:47:28,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:47:28,597 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 13:47:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:47:28,617 INFO L93 Difference]: Finished difference Result 150 states and 255 transitions. [2024-11-16 13:47:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:47:28,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2024-11-16 13:47:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:47:28,624 INFO L225 Difference]: With dead ends: 150 [2024-11-16 13:47:28,624 INFO L226 Difference]: Without dead ends: 74 [2024-11-16 13:47:28,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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 13:47:28,628 INFO L432 NwaCegarLoop]: 110 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, 110 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 13:47:28,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:47:28,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-16 13:47:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-16 13:47:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 13:47:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions. [2024-11-16 13:47:28,666 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 140 [2024-11-16 13:47:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:47:28,666 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 110 transitions. [2024-11-16 13:47:28,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 13:47:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions. [2024-11-16 13:47:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 13:47:28,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:47:28,669 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:47:28,681 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 13:47:28,870 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 13:47:28,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:47:28,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:47:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1415585022, now seen corresponding path program 1 times [2024-11-16 13:47:28,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:47:28,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307452739] [2024-11-16 13:47:28,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:28,873 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 13:47:28,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:47:28,876 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 13:47:28,877 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 13:47:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:29,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 13:47:29,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:47:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:47:30,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:47:30,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:47:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307452739] [2024-11-16 13:47:30,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307452739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:47:30,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:47:30,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:47:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690281686] [2024-11-16 13:47:30,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:47:30,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:47:30,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:47:30,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:47:30,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:47:30,254 INFO L87 Difference]: Start difference. First operand 74 states and 110 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:47:32,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:47:34,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:47:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:47:34,777 INFO L93 Difference]: Finished difference Result 218 states and 326 transitions. [2024-11-16 13:47:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:47:34,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-11-16 13:47:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:47:34,802 INFO L225 Difference]: With dead ends: 218 [2024-11-16 13:47:34,803 INFO L226 Difference]: Without dead ends: 147 [2024-11-16 13:47:34,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:47:34,804 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 78 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-16 13:47:34,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 365 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-16 13:47:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-16 13:47:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 114. [2024-11-16 13:47:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 13:47:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2024-11-16 13:47:34,866 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 141 [2024-11-16 13:47:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:47:34,866 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2024-11-16 13:47:34,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:47:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2024-11-16 13:47:34,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 13:47:34,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:47:34,869 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:47:34,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 13:47:35,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:47:35,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:47:35,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:47:35,071 INFO L85 PathProgramCache]: Analyzing trace with hash 689507654, now seen corresponding path program 1 times [2024-11-16 13:47:35,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:47:35,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586478767] [2024-11-16 13:47:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:35,072 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 13:47:35,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:47:35,074 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:47:35,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 13:47:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 13:47:35,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:47:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:47:35,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:47:35,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:47:35,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586478767] [2024-11-16 13:47:35,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586478767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:47:35,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:47:35,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:47:35,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166878628] [2024-11-16 13:47:35,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:47:35,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:47:35,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:47:35,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:47:35,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:47:35,403 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:47:36,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:47:36,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:47:36,737 INFO L93 Difference]: Finished difference Result 230 states and 340 transitions. [2024-11-16 13:47:36,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:47:36,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-11-16 13:47:36,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:47:36,740 INFO L225 Difference]: With dead ends: 230 [2024-11-16 13:47:36,740 INFO L226 Difference]: Without dead ends: 159 [2024-11-16 13:47:36,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:47:36,743 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 54 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 13:47:36,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 250 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 13:47:36,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-16 13:47:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2024-11-16 13:47:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 106 states have internal predecessors, (136), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 13:47:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 228 transitions. [2024-11-16 13:47:36,762 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 228 transitions. Word has length 142 [2024-11-16 13:47:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:47:36,762 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 228 transitions. [2024-11-16 13:47:36,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:47:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 228 transitions. [2024-11-16 13:47:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 13:47:36,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:47:36,764 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:47:36,776 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 (4)] Ended with exit code 0 [2024-11-16 13:47:36,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:47:36,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:47:36,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:47:36,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1348548635, now seen corresponding path program 1 times [2024-11-16 13:47:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:47:36,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294773616] [2024-11-16 13:47:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:36,966 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 13:47:36,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:47:36,969 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 13:47:36,970 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 13:47:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 13:47:37,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:47:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 19 proven. 57 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-16 13:47:37,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:47:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 13:47:38,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:47:38,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294773616] [2024-11-16 13:47:38,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294773616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:47:38,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:47:38,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-16 13:47:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348383001] [2024-11-16 13:47:38,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:47:38,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 13:47:38,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:47:38,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 13:47:38,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-16 13:47:38,038 INFO L87 Difference]: Start difference. First operand 155 states and 228 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-16 13:47:40,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:47:41,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:47:43,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:47:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:47:43,272 INFO L93 Difference]: Finished difference Result 370 states and 527 transitions. [2024-11-16 13:47:43,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 13:47:43,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 142 [2024-11-16 13:47:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:47:43,275 INFO L225 Difference]: With dead ends: 370 [2024-11-16 13:47:43,275 INFO L226 Difference]: Without dead ends: 258 [2024-11-16 13:47:43,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-16 13:47:43,277 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 179 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:47:43,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 216 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-16 13:47:43,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-16 13:47:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2024-11-16 13:47:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 153 states have (on average 1.3398692810457515) internal successors, (205), 154 states have internal predecessors, (205), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 13:47:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 297 transitions. [2024-11-16 13:47:43,302 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 297 transitions. Word has length 142 [2024-11-16 13:47:43,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:47:43,303 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 297 transitions. [2024-11-16 13:47:43,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-16 13:47:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 297 transitions. [2024-11-16 13:47:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 13:47:43,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:47:43,304 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:47:43,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 13:47:43,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:47:43,505 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:47:43,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:47:43,506 INFO L85 PathProgramCache]: Analyzing trace with hash 394261700, now seen corresponding path program 1 times [2024-11-16 13:47:43,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:47:43,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036763036] [2024-11-16 13:47:43,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:43,507 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 13:47:43,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:47:43,509 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:47:43,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 13:47:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:43,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 13:47:43,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:47:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 19 proven. 57 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-16 13:47:44,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:47:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:47:45,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:47:45,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036763036] [2024-11-16 13:47:45,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036763036] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 13:47:45,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 13:47:45,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-16 13:47:45,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622205852] [2024-11-16 13:47:45,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:47:45,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:47:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:47:45,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:47:45,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:47:45,335 INFO L87 Difference]: Start difference. First operand 206 states and 297 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 13:47:47,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:47:49,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:47:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:47:49,073 INFO L93 Difference]: Finished difference Result 543 states and 781 transitions. [2024-11-16 13:47:49,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:47:49,074 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), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2024-11-16 13:47:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:47:49,077 INFO L225 Difference]: With dead ends: 543 [2024-11-16 13:47:49,077 INFO L226 Difference]: Without dead ends: 384 [2024-11-16 13:47:49,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:47:49,081 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 113 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-16 13:47:49,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 302 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-16 13:47:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-16 13:47:49,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 362. [2024-11-16 13:47:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 279 states have (on average 1.3655913978494623) internal successors, (381), 281 states have internal predecessors, (381), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 13:47:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 525 transitions. [2024-11-16 13:47:49,121 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 525 transitions. Word has length 142 [2024-11-16 13:47:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:47:49,121 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 525 transitions. [2024-11-16 13:47:49,121 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), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 13:47:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 525 transitions. [2024-11-16 13:47:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 13:47:49,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:47:49,124 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:47:49,141 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 (6)] Ended with exit code 0 [2024-11-16 13:47:49,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 13:47:49,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:47:49,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:47:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash 772013889, now seen corresponding path program 1 times [2024-11-16 13:47:49,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:47:49,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195701427] [2024-11-16 13:47:49,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:49,327 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 13:47:49,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:47:49,328 INFO L229 MonitoredProcess]: Starting monitored process 7 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 13:47:49,329 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 (7)] Waiting until timeout for monitored process [2024-11-16 13:47:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:49,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 13:47:49,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:47:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 13:47:50,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:47:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:47:50,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:47:50,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195701427] [2024-11-16 13:47:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195701427] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 13:47:50,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 13:47:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-11-16 13:47:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632946716] [2024-11-16 13:47:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:47:50,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:47:50,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:47:50,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:47:50,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-16 13:47:50,354 INFO L87 Difference]: Start difference. First operand 362 states and 525 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:47:52,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:47:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:47:52,909 INFO L93 Difference]: Finished difference Result 720 states and 1037 transitions. [2024-11-16 13:47:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:47:52,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-16 13:47:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:47:52,914 INFO L225 Difference]: With dead ends: 720 [2024-11-16 13:47:52,914 INFO L226 Difference]: Without dead ends: 405 [2024-11-16 13:47:52,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-16 13:47:52,915 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 46 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 13:47:52,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 251 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 13:47:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-16 13:47:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 362. [2024-11-16 13:47:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 279 states have (on average 1.3512544802867383) internal successors, (377), 281 states have internal predecessors, (377), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 13:47:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 521 transitions. [2024-11-16 13:47:52,944 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 521 transitions. Word has length 143 [2024-11-16 13:47:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:47:52,945 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 521 transitions. [2024-11-16 13:47:52,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:47:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 521 transitions. [2024-11-16 13:47:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 13:47:52,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:47:52,948 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:47:52,962 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 (7)] Ended with exit code 0 [2024-11-16 13:47:53,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 13:47:53,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:47:53,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:47:53,150 INFO L85 PathProgramCache]: Analyzing trace with hash 983364802, now seen corresponding path program 1 times [2024-11-16 13:47:53,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:47:53,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035104487] [2024-11-16 13:47:53,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:53,150 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 13:47:53,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:47:53,151 INFO L229 MonitoredProcess]: Starting monitored process 8 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 13:47:53,152 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 (8)] Waiting until timeout for monitored process [2024-11-16 13:47:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:53,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 13:47:53,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:47:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 437 proven. 87 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-16 13:47:54,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:47:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 13:47:54,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:47:54,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035104487] [2024-11-16 13:47:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035104487] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:47:54,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:47:54,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2024-11-16 13:47:54,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561148688] [2024-11-16 13:47:54,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:47:54,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 13:47:54,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:47:54,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 13:47:54,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-16 13:47:54,979 INFO L87 Difference]: Start difference. First operand 362 states and 521 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 5 states have call successors, (39), 4 states have call predecessors, (39), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-11-16 13:47:58,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:48:01,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:48:01,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:01,674 INFO L93 Difference]: Finished difference Result 812 states and 1134 transitions. [2024-11-16 13:48:01,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 13:48:01,675 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 5 states have call successors, (39), 4 states have call predecessors, (39), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) Word has length 143 [2024-11-16 13:48:01,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:01,677 INFO L225 Difference]: With dead ends: 812 [2024-11-16 13:48:01,678 INFO L226 Difference]: Without dead ends: 497 [2024-11-16 13:48:01,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=294, Invalid=896, Unknown=0, NotChecked=0, Total=1190 [2024-11-16 13:48:01,680 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 312 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:01,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 337 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-16 13:48:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-16 13:48:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 230. [2024-11-16 13:48:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 171 states have (on average 1.280701754385965) internal successors, (219), 172 states have internal predecessors, (219), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 13:48:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 311 transitions. [2024-11-16 13:48:01,701 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 311 transitions. Word has length 143 [2024-11-16 13:48:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:01,702 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 311 transitions. [2024-11-16 13:48:01,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 5 states have call successors, (39), 4 states have call predecessors, (39), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-11-16 13:48:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 311 transitions. [2024-11-16 13:48:01,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 13:48:01,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:01,704 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:48:01,720 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 (8)] Ended with exit code 0 [2024-11-16 13:48:01,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 13:48:01,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:01,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2007397726, now seen corresponding path program 1 times [2024-11-16 13:48:01,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:48:01,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641311695] [2024-11-16 13:48:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:01,905 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 13:48:01,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:48:01,908 INFO L229 MonitoredProcess]: Starting monitored process 9 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 13:48:01,909 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 (9)] Waiting until timeout for monitored process [2024-11-16 13:48:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:02,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-16 13:48:02,203 INFO L278 TraceCheckSpWp]: Computing forward predicates...