./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.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 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:56:11,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:56:11,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:56:11,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:56:11,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:56:11,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:56:11,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:56:11,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:56:11,427 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:56:11,427 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:56:11,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:56:11,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:56:11,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:56:11,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:56:11,431 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:56:11,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:56:11,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:56:11,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:56:11,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:56:11,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:56:11,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:56:11,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:56:11,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:56:11,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:56:11,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:56:11,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:56:11,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:56:11,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:56:11,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:56:11,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:56:11,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:56:11,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:56:11,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:56:11,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:56:11,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:56:11,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:56:11,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:56:11,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:56:11,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:56:11,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:56:11,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:56:11,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:56:11,443 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 -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 [2024-11-08 19:56:11,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:56:11,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:56:11,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:56:11,707 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:56:11,707 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:56:11,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-08 19:56:13,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:56:13,305 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:56:13,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-08 19:56:13,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3669d9a6/8470292bee0046a981b3dd18383a1093/FLAGa1cffd67d [2024-11-08 19:56:13,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3669d9a6/8470292bee0046a981b3dd18383a1093 [2024-11-08 19:56:13,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:56:13,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:56:13,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:56:13,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:56:13,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:56:13,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13dfcb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13, skipping insertion in model container [2024-11-08 19:56:13,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:56:13,518 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_fillercodesize_normal_file-3.i[912,925] [2024-11-08 19:56:13,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:56:13,583 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:56:13,595 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_fillercodesize_normal_file-3.i[912,925] [2024-11-08 19:56:13,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:56:13,646 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:56:13,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13 WrapperNode [2024-11-08 19:56:13,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:56:13,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:56:13,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:56:13,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:56:13,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,708 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-08 19:56:13,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:56:13,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:56:13,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:56:13,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:56:13,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,753 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:56:13,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:56:13,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:56:13,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:56:13,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:56:13,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (1/1) ... [2024-11-08 19:56:13,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:56:13,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:56:13,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:56:13,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:56:13,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:56:13,887 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:56:13,888 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:56:13,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:56:13,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:56:13,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:56:13,971 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:56:13,973 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:56:14,403 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 19:56:14,404 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:56:14,421 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:56:14,421 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:56:14,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:56:14 BoogieIcfgContainer [2024-11-08 19:56:14,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:56:14,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:56:14,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:56:14,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:56:14,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:56:13" (1/3) ... [2024-11-08 19:56:14,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e09614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:56:14, skipping insertion in model container [2024-11-08 19:56:14,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:13" (2/3) ... [2024-11-08 19:56:14,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e09614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:56:14, skipping insertion in model container [2024-11-08 19:56:14,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:56:14" (3/3) ... [2024-11-08 19:56:14,433 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-08 19:56:14,451 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:56:14,451 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:56:14,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:56:14,518 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;@22b40af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:56:14,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:56:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 19:56:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 19:56:14,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:14,532 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:14,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:14,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:14,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1623939, now seen corresponding path program 1 times [2024-11-08 19:56:14,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:14,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991182022] [2024-11-08 19:56:14,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:56:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:56:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 19:56:14,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:14,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991182022] [2024-11-08 19:56:14,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991182022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:14,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:14,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:56:14,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142864847] [2024-11-08 19:56:14,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:14,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:56:14,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:14,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:56:14,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:56:14,949 INFO L87 Difference]: Start difference. First operand has 71 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 19:56:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:14,981 INFO L93 Difference]: Finished difference Result 135 states and 229 transitions. [2024-11-08 19:56:14,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:56:14,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 105 [2024-11-08 19:56:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:14,990 INFO L225 Difference]: With dead ends: 135 [2024-11-08 19:56:14,991 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 19:56:14,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:56:14,999 INFO L432 NwaCegarLoop]: 102 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, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:15,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:56:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 19:56:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-08 19:56:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 19:56:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 102 transitions. [2024-11-08 19:56:15,040 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 102 transitions. Word has length 105 [2024-11-08 19:56:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:15,041 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 102 transitions. [2024-11-08 19:56:15,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 19:56:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 102 transitions. [2024-11-08 19:56:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 19:56:15,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:15,045 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:15,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:56:15,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:15,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:15,046 INFO L85 PathProgramCache]: Analyzing trace with hash -662991041, now seen corresponding path program 1 times [2024-11-08 19:56:15,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:15,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827666232] [2024-11-08 19:56:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:15,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:56:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:56:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 19:56:15,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:15,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827666232] [2024-11-08 19:56:15,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827666232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:15,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:15,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:56:15,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954280501] [2024-11-08 19:56:15,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:15,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:56:15,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:15,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:56:15,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:56:15,548 INFO L87 Difference]: Start difference. First operand 67 states and 102 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:15,637 INFO L93 Difference]: Finished difference Result 195 states and 300 transitions. [2024-11-08 19:56:15,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:56:15,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-11-08 19:56:15,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:15,640 INFO L225 Difference]: With dead ends: 195 [2024-11-08 19:56:15,640 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 19:56:15,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:56:15,644 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 61 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:15,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 179 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:56:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 19:56:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-08 19:56:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 19:56:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 196 transitions. [2024-11-08 19:56:15,687 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 196 transitions. Word has length 105 [2024-11-08 19:56:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:15,687 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 196 transitions. [2024-11-08 19:56:15,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 196 transitions. [2024-11-08 19:56:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 19:56:15,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:15,690 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:15,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:56:15,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:15,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:15,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1292298218, now seen corresponding path program 1 times [2024-11-08 19:56:15,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:15,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845584615] [2024-11-08 19:56:15,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:15,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:56:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:56:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 19:56:15,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845584615] [2024-11-08 19:56:15,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845584615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:15,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:15,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:56:15,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205077251] [2024-11-08 19:56:15,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:15,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:56:15,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:15,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:56:15,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:56:15,962 INFO L87 Difference]: Start difference. First operand 129 states and 196 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:16,065 INFO L93 Difference]: Finished difference Result 373 states and 572 transitions. [2024-11-08 19:56:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:56:16,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2024-11-08 19:56:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:16,072 INFO L225 Difference]: With dead ends: 373 [2024-11-08 19:56:16,074 INFO L226 Difference]: Without dead ends: 247 [2024-11-08 19:56:16,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:56:16,077 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 86 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:16,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 257 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:56:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-08 19:56:16,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2024-11-08 19:56:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 19:56:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 372 transitions. [2024-11-08 19:56:16,132 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 372 transitions. Word has length 106 [2024-11-08 19:56:16,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:16,133 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 372 transitions. [2024-11-08 19:56:16,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 372 transitions. [2024-11-08 19:56:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 19:56:16,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:16,138 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:16,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:56:16,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:16,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:16,139 INFO L85 PathProgramCache]: Analyzing trace with hash 257019204, now seen corresponding path program 1 times [2024-11-08 19:56:16,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:16,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447453593] [2024-11-08 19:56:16,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:16,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:56:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:56:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 19:56:16,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447453593] [2024-11-08 19:56:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447453593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:16,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:16,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:56:16,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885226342] [2024-11-08 19:56:16,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:16,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:56:16,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:16,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:56:16,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:56:16,284 INFO L87 Difference]: Start difference. First operand 245 states and 372 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:16,348 INFO L93 Difference]: Finished difference Result 605 states and 914 transitions. [2024-11-08 19:56:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:56:16,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106 [2024-11-08 19:56:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:16,351 INFO L225 Difference]: With dead ends: 605 [2024-11-08 19:56:16,352 INFO L226 Difference]: Without dead ends: 363 [2024-11-08 19:56:16,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:56:16,357 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 43 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:16,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 216 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:56:16,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-08 19:56:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 281. [2024-11-08 19:56:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 216 states have (on average 1.4074074074074074) internal successors, (304), 216 states have internal predecessors, (304), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 19:56:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 424 transitions. [2024-11-08 19:56:16,403 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 424 transitions. Word has length 106 [2024-11-08 19:56:16,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:16,404 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 424 transitions. [2024-11-08 19:56:16,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 424 transitions. [2024-11-08 19:56:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 19:56:16,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:16,409 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:16,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:56:16,409 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:16,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:16,410 INFO L85 PathProgramCache]: Analyzing trace with hash -453972667, now seen corresponding path program 1 times [2024-11-08 19:56:16,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:16,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457012852] [2024-11-08 19:56:16,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:16,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:56:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:56:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-08 19:56:17,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:17,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457012852] [2024-11-08 19:56:17,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457012852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:17,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:17,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:56:17,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437134230] [2024-11-08 19:56:17,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:17,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:56:17,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:17,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:56:17,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:56:17,552 INFO L87 Difference]: Start difference. First operand 281 states and 424 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:18,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:18,434 INFO L93 Difference]: Finished difference Result 857 states and 1248 transitions. [2024-11-08 19:56:18,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 19:56:18,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-11-08 19:56:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:18,439 INFO L225 Difference]: With dead ends: 857 [2024-11-08 19:56:18,439 INFO L226 Difference]: Without dead ends: 579 [2024-11-08 19:56:18,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:56:18,441 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 210 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:18,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 376 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 19:56:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-08 19:56:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 351. [2024-11-08 19:56:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 282 states have (on average 1.4219858156028369) internal successors, (401), 282 states have internal predecessors, (401), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 19:56:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 521 transitions. [2024-11-08 19:56:18,494 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 521 transitions. Word has length 107 [2024-11-08 19:56:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:18,495 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 521 transitions. [2024-11-08 19:56:18,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 521 transitions. [2024-11-08 19:56:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 19:56:18,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:18,497 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:18,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:56:18,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:18,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2042320569, now seen corresponding path program 1 times [2024-11-08 19:56:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:18,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275343893] [2024-11-08 19:56:18,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:56:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:56:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 19:56:18,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:18,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275343893] [2024-11-08 19:56:18,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275343893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:18,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:18,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:56:18,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118921318] [2024-11-08 19:56:18,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:18,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:56:18,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:18,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:56:18,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:56:18,714 INFO L87 Difference]: Start difference. First operand 351 states and 521 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:18,830 INFO L93 Difference]: Finished difference Result 851 states and 1264 transitions. [2024-11-08 19:56:18,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:56:18,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-11-08 19:56:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:18,836 INFO L225 Difference]: With dead ends: 851 [2024-11-08 19:56:18,836 INFO L226 Difference]: Without dead ends: 503 [2024-11-08 19:56:18,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:56:18,839 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 62 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:18,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 209 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:56:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-08 19:56:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2024-11-08 19:56:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 398 states have (on average 1.4095477386934674) internal successors, (561), 398 states have internal predecessors, (561), 90 states have call successors, (90), 12 states have call predecessors, (90), 12 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 19:56:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 741 transitions. [2024-11-08 19:56:18,915 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 741 transitions. Word has length 107 [2024-11-08 19:56:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:18,916 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 741 transitions. [2024-11-08 19:56:18,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 741 transitions. [2024-11-08 19:56:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 19:56:18,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:18,918 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:18,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:56:18,919 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:18,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:18,919 INFO L85 PathProgramCache]: Analyzing trace with hash 66668527, now seen corresponding path program 1 times [2024-11-08 19:56:18,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:18,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732288209] [2024-11-08 19:56:18,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:18,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:56:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:56:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 19:56:19,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:19,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732288209] [2024-11-08 19:56:19,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732288209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:19,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:19,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:56:19,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589998643] [2024-11-08 19:56:19,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:19,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:56:19,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:19,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:56:19,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:56:19,249 INFO L87 Difference]: Start difference. First operand 501 states and 741 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 19:56:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:19,755 INFO L93 Difference]: Finished difference Result 1409 states and 2091 transitions. [2024-11-08 19:56:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:56:19,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 107 [2024-11-08 19:56:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:19,762 INFO L225 Difference]: With dead ends: 1409 [2024-11-08 19:56:19,762 INFO L226 Difference]: Without dead ends: 1159 [2024-11-08 19:56:19,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:56:19,764 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 298 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:19,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:56:19,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-08 19:56:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1143. [2024-11-08 19:56:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 904 states have (on average 1.413716814159292) internal successors, (1278), 904 states have internal predecessors, (1278), 210 states have call successors, (210), 28 states have call predecessors, (210), 28 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-08 19:56:19,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1698 transitions. [2024-11-08 19:56:19,918 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1698 transitions. Word has length 107 [2024-11-08 19:56:19,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:19,918 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1698 transitions. [2024-11-08 19:56:19,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 19:56:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1698 transitions. [2024-11-08 19:56:19,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 19:56:19,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:19,924 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:19,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:56:19,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:19,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1351691309, now seen corresponding path program 1 times [2024-11-08 19:56:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:19,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983059957] [2024-11-08 19:56:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:19,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:56:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:56:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 19:56:20,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:20,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983059957] [2024-11-08 19:56:20,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983059957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:20,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:20,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 19:56:20,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834965829] [2024-11-08 19:56:20,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:20,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:56:20,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:20,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:56:20,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:56:20,284 INFO L87 Difference]: Start difference. First operand 1143 states and 1698 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 19:56:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:20,833 INFO L93 Difference]: Finished difference Result 2305 states and 3417 transitions. [2024-11-08 19:56:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:56:20,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-08 19:56:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:20,841 INFO L225 Difference]: With dead ends: 2305 [2024-11-08 19:56:20,842 INFO L226 Difference]: Without dead ends: 1165 [2024-11-08 19:56:20,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:56:20,845 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 305 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:20,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 571 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 19:56:20,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2024-11-08 19:56:20,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1145. [2024-11-08 19:56:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 906 states have (on average 1.4094922737306843) internal successors, (1277), 906 states have internal predecessors, (1277), 210 states have call successors, (210), 28 states have call predecessors, (210), 28 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-08 19:56:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1697 transitions. [2024-11-08 19:56:20,935 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1697 transitions. Word has length 108 [2024-11-08 19:56:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:20,936 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1697 transitions. [2024-11-08 19:56:20,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 19:56:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1697 transitions. [2024-11-08 19:56:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 19:56:20,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:20,938 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:20,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:56:20,939 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:20,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash 685923855, now seen corresponding path program 1 times [2024-11-08 19:56:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956338429] [2024-11-08 19:56:20,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:56:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:56:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-08 19:56:21,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:21,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956338429] [2024-11-08 19:56:21,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956338429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:56:21,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448467790] [2024-11-08 19:56:21,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:21,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:56:21,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:56:21,588 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:56:21,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:56:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:21,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 19:56:21,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:56:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 310 proven. 21 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-08 19:56:22,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:56:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 111 proven. 39 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-11-08 19:56:23,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448467790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:56:23,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:56:23,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35 [2024-11-08 19:56:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016953606] [2024-11-08 19:56:23,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:56:23,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-08 19:56:23,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:23,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 19:56:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=873, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 19:56:23,623 INFO L87 Difference]: Start difference. First operand 1145 states and 1697 transitions. Second operand has 35 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2024-11-08 19:56:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:25,231 INFO L93 Difference]: Finished difference Result 2139 states and 3046 transitions. [2024-11-08 19:56:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 19:56:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) Word has length 108 [2024-11-08 19:56:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:25,239 INFO L225 Difference]: With dead ends: 2139 [2024-11-08 19:56:25,239 INFO L226 Difference]: Without dead ends: 1297 [2024-11-08 19:56:25,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1114, Invalid=2546, Unknown=0, NotChecked=0, Total=3660 [2024-11-08 19:56:25,244 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 983 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:25,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 445 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 19:56:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2024-11-08 19:56:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 527. [2024-11-08 19:56:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 406 states have (on average 1.3226600985221675) internal successors, (537), 406 states have internal predecessors, (537), 90 states have call successors, (90), 30 states have call predecessors, (90), 30 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 19:56:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 717 transitions. [2024-11-08 19:56:25,320 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 717 transitions. Word has length 108 [2024-11-08 19:56:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:25,320 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 717 transitions. [2024-11-08 19:56:25,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2024-11-08 19:56:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 717 transitions. [2024-11-08 19:56:25,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 19:56:25,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:25,322 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:25,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 19:56:25,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:56:25,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:25,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:25,528 INFO L85 PathProgramCache]: Analyzing trace with hash 206212576, now seen corresponding path program 1 times [2024-11-08 19:56:25,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:25,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024639137] [2024-11-08 19:56:25,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:25,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:56:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:56:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 19:56:25,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:25,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024639137] [2024-11-08 19:56:25,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024639137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:25,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:25,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:56:25,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998534844] [2024-11-08 19:56:25,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:25,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:56:25,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:25,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:56:25,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:56:25,757 INFO L87 Difference]: Start difference. First operand 527 states and 717 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:26,062 INFO L93 Difference]: Finished difference Result 1356 states and 1873 transitions. [2024-11-08 19:56:26,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:56:26,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-08 19:56:26,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:26,068 INFO L225 Difference]: With dead ends: 1356 [2024-11-08 19:56:26,069 INFO L226 Difference]: Without dead ends: 1091 [2024-11-08 19:56:26,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:56:26,070 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 177 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:26,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 366 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:56:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2024-11-08 19:56:26,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 955. [2024-11-08 19:56:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 754 states have (on average 1.343501326259947) internal successors, (1013), 754 states have internal predecessors, (1013), 150 states have call successors, (150), 50 states have call predecessors, (150), 50 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-08 19:56:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1313 transitions. [2024-11-08 19:56:26,188 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1313 transitions. Word has length 108 [2024-11-08 19:56:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:26,189 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1313 transitions. [2024-11-08 19:56:26,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:26,189 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1313 transitions. [2024-11-08 19:56:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 19:56:26,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:26,190 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:26,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 19:56:26,191 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:26,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:26,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1387213154, now seen corresponding path program 1 times [2024-11-08 19:56:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:26,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689859200] [2024-11-08 19:56:26,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:56:26,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930693115] [2024-11-08 19:56:26,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:26,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:56:26,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:56:26,241 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-08 19:56:26,242 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-08 19:56:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:56:26,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:56:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:56:26,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:56:26,580 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:56:26,581 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:56:26,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:56:26,784 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,SelfDestructingSolverStorable10 [2024-11-08 19:56:26,787 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:26,876 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:56:26,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:56:26 BoogieIcfgContainer [2024-11-08 19:56:26,879 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:56:26,880 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:56:26,880 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:56:26,880 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:56:26,881 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:56:14" (3/4) ... [2024-11-08 19:56:26,883 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:56:26,888 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:56:26,889 INFO L158 Benchmark]: Toolchain (without parser) took 13556.58ms. Allocated memory was 153.1MB in the beginning and 362.8MB in the end (delta: 209.7MB). Free memory was 98.6MB in the beginning and 313.8MB in the end (delta: -215.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:56:26,889 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:56:26,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.80ms. Allocated memory is still 153.1MB. Free memory was 98.3MB in the beginning and 83.1MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:56:26,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.75ms. Allocated memory is still 153.1MB. Free memory was 82.7MB in the beginning and 79.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:56:26,890 INFO L158 Benchmark]: Boogie Preprocessor took 83.94ms. Allocated memory is still 153.1MB. Free memory was 78.9MB in the beginning and 74.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:56:26,890 INFO L158 Benchmark]: RCFGBuilder took 627.73ms. Allocated memory was 153.1MB in the beginning and 209.7MB in the end (delta: 56.6MB). Free memory was 74.0MB in the beginning and 169.5MB in the end (delta: -95.5MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2024-11-08 19:56:26,890 INFO L158 Benchmark]: TraceAbstraction took 12455.36ms. Allocated memory was 209.7MB in the beginning and 362.8MB in the end (delta: 153.1MB). Free memory was 169.5MB in the beginning and 313.8MB in the end (delta: -144.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-11-08 19:56:26,891 INFO L158 Benchmark]: Witness Printer took 8.77ms. Allocated memory is still 362.8MB. Free memory is still 313.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:56:26,894 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.19ms. Allocated memory is still 153.1MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.80ms. Allocated memory is still 153.1MB. Free memory was 98.3MB in the beginning and 83.1MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.75ms. Allocated memory is still 153.1MB. Free memory was 82.7MB in the beginning and 79.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.94ms. Allocated memory is still 153.1MB. Free memory was 78.9MB in the beginning and 74.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 627.73ms. Allocated memory was 153.1MB in the beginning and 209.7MB in the end (delta: 56.6MB). Free memory was 74.0MB in the beginning and 169.5MB in the end (delta: -95.5MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12455.36ms. Allocated memory was 209.7MB in the beginning and 362.8MB in the end (delta: 153.1MB). Free memory was 169.5MB in the beginning and 313.8MB in the end (delta: -144.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Witness Printer took 8.77ms. Allocated memory is still 362.8MB. Free memory is still 313.8MB. 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 117, overapproximation of bitwiseOr at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int last_1_var_1_10 = 256; [L38] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L113] last_1_var_1_10 = var_1_10 [L114] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L124] RET updateLastVariables() [L125] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L90] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L90] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L92] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L94] var_1_13 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L95] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L97] var_1_14 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L98] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L103] var_1_16 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L104] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L106] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L108] var_1_22 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L109] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L110] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L110] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L125] RET updateVariables() [L126] CALL step() [L42] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L47] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-8, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L48] COND TRUE stepLocal_2 > last_1_var_1_10 [L49] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L51] COND FALSE !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L56] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L57] COND FALSE !(stepLocal_1 || var_1_3) [L62] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L64] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L75] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L80] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L80] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L81] COND TRUE var_1_20 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L82] COND FALSE !(var_1_12 == var_1_12) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L117-L118] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2231 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2225 mSDsluCounter, 3191 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2106 mSDsCounter, 556 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1606 IncrementalHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 556 mSolverCounterUnsat, 1085 mSDtfsCounter, 1606 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 533 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1145occurred in iteration=8, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 1258 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1393 NumberOfCodeBlocks, 1393 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1271 ConstructedInterpolants, 0 QuantifiedInterpolants, 5432 SizeOfPredicates, 6 NumberOfNonLiveVariables, 255 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 4959/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 19:56:26,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercodesize_normal_file-3.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 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:56:29,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:56:29,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:56:29,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:56:29,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:56:29,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:56:29,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:56:29,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:56:29,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:56:29,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:56:29,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:56:29,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:56:29,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:56:29,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:56:29,296 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:56:29,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:56:29,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:56:29,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:56:29,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:56:29,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:56:29,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:56:29,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:56:29,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:56:29,300 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:56:29,300 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:56:29,301 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:56:29,301 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:56:29,301 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:56:29,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:56:29,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:56:29,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:56:29,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:56:29,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:56:29,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:56:29,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:56:29,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:56:29,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:56:29,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:56:29,312 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:56:29,312 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:56:29,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:56:29,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:56:29,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:56:29,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:56:29,314 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 -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 [2024-11-08 19:56:29,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:56:29,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:56:29,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:56:29,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:56:29,689 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:56:29,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-08 19:56:31,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:56:31,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:56:31,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-08 19:56:31,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffcde55a2/6509437713104a68afddda7939e5088b/FLAGb842e3bab [2024-11-08 19:56:31,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffcde55a2/6509437713104a68afddda7939e5088b [2024-11-08 19:56:31,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:56:31,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:56:31,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:56:31,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:56:31,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:56:31,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:31,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7b14f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31, skipping insertion in model container [2024-11-08 19:56:31,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:31,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:56:31,758 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_fillercodesize_normal_file-3.i[912,925] [2024-11-08 19:56:31,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:56:31,839 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:56:31,853 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_fillercodesize_normal_file-3.i[912,925] [2024-11-08 19:56:31,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:56:31,912 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:56:31,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31 WrapperNode [2024-11-08 19:56:31,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:56:31,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:56:31,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:56:31,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:56:31,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:31,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:31,978 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-08 19:56:31,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:56:31,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:56:31,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:56:31,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:56:31,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:31,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:31,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:32,013 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:56:32,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:32,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:32,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:32,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:32,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:32,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:32,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:56:32,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:56:32,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:56:32,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:56:32,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (1/1) ... [2024-11-08 19:56:32,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:56:32,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:56:32,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:56:32,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:56:32,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:56:32,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:56:32,137 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:56:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:56:32,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:56:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:56:32,234 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:56:32,237 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:56:44,840 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 19:56:44,840 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:56:44,854 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:56:44,855 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:56:44,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:56:44 BoogieIcfgContainer [2024-11-08 19:56:44,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:56:44,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:56:44,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:56:44,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:56:44,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:56:31" (1/3) ... [2024-11-08 19:56:44,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c30d869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:56:44, skipping insertion in model container [2024-11-08 19:56:44,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:31" (2/3) ... [2024-11-08 19:56:44,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c30d869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:56:44, skipping insertion in model container [2024-11-08 19:56:44,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:56:44" (3/3) ... [2024-11-08 19:56:44,869 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-08 19:56:44,885 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:56:44,885 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:56:44,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:56:44,948 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;@65243d19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:56:44,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:56:44,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 19:56:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 19:56:44,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:44,961 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:44,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:44,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:44,966 INFO L85 PathProgramCache]: Analyzing trace with hash 990176220, now seen corresponding path program 1 times [2024-11-08 19:56:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:56:44,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038276250] [2024-11-08 19:56:44,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:44,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:56:44,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:56:44,982 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:56:44,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:56:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:45,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:56:45,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:56:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-08 19:56:45,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:56:45,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:56:45,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038276250] [2024-11-08 19:56:45,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038276250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:45,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:45,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:56:45,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662276739] [2024-11-08 19:56:45,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:45,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:56:45,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:56:45,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:56:45,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:56:45,887 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 19:56:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:45,915 INFO L93 Difference]: Finished difference Result 113 states and 193 transitions. [2024-11-08 19:56:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:56:45,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2024-11-08 19:56:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:45,924 INFO L225 Difference]: With dead ends: 113 [2024-11-08 19:56:45,924 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 19:56:45,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:56:45,930 INFO L432 NwaCegarLoop]: 84 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, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:45,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:56:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 19:56:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-08 19:56:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 19:56:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2024-11-08 19:56:45,964 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 102 [2024-11-08 19:56:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:45,965 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2024-11-08 19:56:45,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 19:56:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2024-11-08 19:56:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 19:56:45,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:45,968 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:45,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:56:46,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:56:46,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:46,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:46,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1728304218, now seen corresponding path program 1 times [2024-11-08 19:56:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:56:46,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469954398] [2024-11-08 19:56:46,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:46,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:56:46,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:56:46,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:56:46,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:56:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:47,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 19:56:47,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:56:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 19:56:49,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:56:49,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:56:49,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469954398] [2024-11-08 19:56:49,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469954398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:49,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:49,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:56:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404846497] [2024-11-08 19:56:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:49,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:56:49,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:56:49,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:56:49,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:56:49,567 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:56:53,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:56:57,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:57:00,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:57:04,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:57:08,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:57:11,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:57:12,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:57:16,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:57:20,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:57:24,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:57:28,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:57:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:57:28,546 INFO L93 Difference]: Finished difference Result 162 states and 246 transitions. [2024-11-08 19:57:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:57:28,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-08 19:57:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:57:28,659 INFO L225 Difference]: With dead ends: 162 [2024-11-08 19:57:28,660 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 19:57:28,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:57:28,662 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 30 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.9s IncrementalHoareTripleChecker+Time [2024-11-08 19:57:28,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 245 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 38.9s Time] [2024-11-08 19:57:28,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 19:57:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-11-08 19:57:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 19:57:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 161 transitions. [2024-11-08 19:57:28,694 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 161 transitions. Word has length 102 [2024-11-08 19:57:28,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:57:28,695 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 161 transitions. [2024-11-08 19:57:28,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:57:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 161 transitions. [2024-11-08 19:57:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 19:57:28,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:57:28,698 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:57:28,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:57:28,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:57:28,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:57:28,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:57:28,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1759076794, now seen corresponding path program 1 times [2024-11-08 19:57:28,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:57:28,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611258811] [2024-11-08 19:57:28,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:57:28,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:57:28,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:57:28,902 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:57:28,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:57:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:57:29,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:57:29,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:57:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 19:57:29,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:57:29,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:57:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611258811] [2024-11-08 19:57:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611258811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:57:29,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:57:29,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:57:29,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358117629] [2024-11-08 19:57:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:57:29,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:57:29,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:57:29,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:57:29,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:57:29,889 INFO L87 Difference]: Start difference. First operand 107 states and 161 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:57:34,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:57:38,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:57:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:57:38,577 INFO L93 Difference]: Finished difference Result 253 states and 380 transitions. [2024-11-08 19:57:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:57:38,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-08 19:57:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:57:38,580 INFO L225 Difference]: With dead ends: 253 [2024-11-08 19:57:38,580 INFO L226 Difference]: Without dead ends: 149 [2024-11-08 19:57:38,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:57:38,587 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 28 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:57:38,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 148 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-08 19:57:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-08 19:57:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2024-11-08 19:57:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 states have internal predecessors, (125), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 19:57:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 185 transitions. [2024-11-08 19:57:38,613 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 185 transitions. Word has length 103 [2024-11-08 19:57:38,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:57:38,614 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 185 transitions. [2024-11-08 19:57:38,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 19:57:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 185 transitions. [2024-11-08 19:57:38,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 19:57:38,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:57:38,618 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:57:38,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 19:57:38,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:57:38,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:57:38,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:57:38,820 INFO L85 PathProgramCache]: Analyzing trace with hash 166944915, now seen corresponding path program 1 times [2024-11-08 19:57:38,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:57:38,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256403464] [2024-11-08 19:57:38,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:57:38,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:57:38,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:57:38,822 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:57:38,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 19:57:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:57:39,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 19:57:39,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:57:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 19:57:42,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:57:42,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:57:42,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256403464] [2024-11-08 19:57:42,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256403464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:57:42,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:57:42,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:57:42,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78148457] [2024-11-08 19:57:42,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:57:42,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:57:42,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:57:42,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:57:42,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:57:42,513 INFO L87 Difference]: Start difference. First operand 125 states and 185 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)