./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_variablewrapping_normal_file-59.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 d3b03823011e7472edac4d496fa9649145126d89af08fba6213c0cfdb5c29eb5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:26:18,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:26:18,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:26:18,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:26:18,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:26:18,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:26:18,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:26:18,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:26:18,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:26:18,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:26:18,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:26:18,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:26:18,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:26:18,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:26:18,574 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:26:18,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:26:18,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:26:18,575 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:26:18,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:26:18,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:26:18,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:26:18,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:26:18,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:26:18,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:26:18,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:26:18,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:26:18,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:26:18,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:26:18,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:26:18,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:26:18,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:26:18,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:26:18,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:26:18,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:26:18,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:26:18,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:26:18,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:26:18,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:26:18,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:26:18,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:26:18,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:26:18,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:26:18,583 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 -> d3b03823011e7472edac4d496fa9649145126d89af08fba6213c0cfdb5c29eb5 [2024-11-19 00:26:18,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:26:18,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:26:18,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:26:18,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:26:18,895 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:26:18,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-59.i [2024-11-19 00:26:20,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:26:20,610 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:26:20,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-59.i [2024-11-19 00:26:20,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20573bd5c/073ad7ee6a23409eb571ba24eb870e68/FLAG3e34e0c47 [2024-11-19 00:26:20,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20573bd5c/073ad7ee6a23409eb571ba24eb870e68 [2024-11-19 00:26:20,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:26:20,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:26:20,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:26:20,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:26:20,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:26:20,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:20,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c368a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20, skipping insertion in model container [2024-11-19 00:26:20,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:20,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:26:20,845 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_variablewrapping_normal_file-59.i[913,926] [2024-11-19 00:26:20,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:26:20,892 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:26:20,904 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_variablewrapping_normal_file-59.i[913,926] [2024-11-19 00:26:20,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:26:20,941 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:26:20,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20 WrapperNode [2024-11-19 00:26:20,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:26:20,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:26:20,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:26:20,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:26:20,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:20,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:20,982 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-19 00:26:20,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:26:20,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:26:20,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:26:20,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:26:20,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:20,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:20,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:21,009 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-19 00:26:21,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:21,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:21,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:21,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:21,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:21,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:21,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:26:21,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:26:21,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:26:21,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:26:21,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (1/1) ... [2024-11-19 00:26:21,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:26:21,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:26:21,058 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-19 00:26:21,070 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-19 00:26:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:26:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:26:21,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:26:21,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:26:21,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:26:21,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:26:21,200 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:26:21,205 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:26:21,463 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-19 00:26:21,463 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:26:21,480 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:26:21,481 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:26:21,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:26:21 BoogieIcfgContainer [2024-11-19 00:26:21,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:26:21,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:26:21,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:26:21,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:26:21,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:26:20" (1/3) ... [2024-11-19 00:26:21,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c500a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:26:21, skipping insertion in model container [2024-11-19 00:26:21,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:26:20" (2/3) ... [2024-11-19 00:26:21,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c500a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:26:21, skipping insertion in model container [2024-11-19 00:26:21,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:26:21" (3/3) ... [2024-11-19 00:26:21,492 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-59.i [2024-11-19 00:26:21,508 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:26:21,508 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:26:21,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:26:21,572 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;@6977dd0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:26:21,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:26:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:26:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 00:26:21,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:26:21,589 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:26:21,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:26:21,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:26:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash 436534238, now seen corresponding path program 1 times [2024-11-19 00:26:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:26:21,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697425080] [2024-11-19 00:26:21,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:26:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:26:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:26:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-19 00:26:21,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:26:21,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697425080] [2024-11-19 00:26:21,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697425080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:26:21,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274338744] [2024-11-19 00:26:21,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:26:21,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:26:21,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:26:21,878 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-19 00:26:21,880 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-19 00:26:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:26:22,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:26:22,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:26:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-19 00:26:22,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:26:22,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274338744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:26:22,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:26:22,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:26:22,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611450454] [2024-11-19 00:26:22,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:26:22,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:26:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:26:22,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:26:22,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:26:22,101 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:26:22,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:26:22,122 INFO L93 Difference]: Finished difference Result 97 states and 168 transitions. [2024-11-19 00:26:22,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:26:22,125 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2024-11-19 00:26:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:26:22,134 INFO L225 Difference]: With dead ends: 97 [2024-11-19 00:26:22,135 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 00:26:22,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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-19 00:26:22,141 INFO L432 NwaCegarLoop]: 71 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, 71 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-19 00:26:22,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:26:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 00:26:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-19 00:26:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:26:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-11-19 00:26:22,182 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 111 [2024-11-19 00:26:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:26:22,182 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-11-19 00:26:22,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 00:26:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-11-19 00:26:22,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 00:26:22,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:26:22,186 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:26:22,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:26:22,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:26:22,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:26:22,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:26:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1117207838, now seen corresponding path program 1 times [2024-11-19 00:26:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:26:22,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320111161] [2024-11-19 00:26:22,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:26:22,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:26:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:26:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:26:22,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:26:22,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320111161] [2024-11-19 00:26:22,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320111161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:26:22,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:26:22,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:26:22,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133682422] [2024-11-19 00:26:22,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:26:22,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:26:22,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:26:22,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:26:22,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:26:22,833 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:26:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:26:23,016 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2024-11-19 00:26:23,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:26:23,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-11-19 00:26:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:26:23,020 INFO L225 Difference]: With dead ends: 139 [2024-11-19 00:26:23,021 INFO L226 Difference]: Without dead ends: 94 [2024-11-19 00:26:23,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:26:23,024 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 40 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:26:23,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 178 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:26:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-19 00:26:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2024-11-19 00:26:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:26:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2024-11-19 00:26:23,055 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 111 [2024-11-19 00:26:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:26:23,056 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2024-11-19 00:26:23,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:26:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2024-11-19 00:26:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 00:26:23,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:26:23,058 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:26:23,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:26:23,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:26:23,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:26:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1580942571, now seen corresponding path program 1 times [2024-11-19 00:26:23,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:26:23,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8716775] [2024-11-19 00:26:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:26:23,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:26:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:26:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:26:27,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:26:27,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8716775] [2024-11-19 00:26:27,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8716775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:26:27,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:26:27,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:26:27,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117149531] [2024-11-19 00:26:27,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:26:27,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:26:27,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:26:27,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:26:27,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:26:27,129 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:26:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:26:27,470 INFO L93 Difference]: Finished difference Result 112 states and 160 transitions. [2024-11-19 00:26:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:26:27,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2024-11-19 00:26:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:26:27,473 INFO L225 Difference]: With dead ends: 112 [2024-11-19 00:26:27,473 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 00:26:27,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:26:27,475 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 37 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:26:27,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 301 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:26:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 00:26:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 89. [2024-11-19 00:26:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:26:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 132 transitions. [2024-11-19 00:26:27,492 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 132 transitions. Word has length 112 [2024-11-19 00:26:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:26:27,492 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 132 transitions. [2024-11-19 00:26:27,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:26:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2024-11-19 00:26:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:26:27,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:26:27,495 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:26:27,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:26:27,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:26:27,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:26:27,496 INFO L85 PathProgramCache]: Analyzing trace with hash 161072197, now seen corresponding path program 1 times [2024-11-19 00:26:27,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:26:27,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924520098] [2024-11-19 00:26:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:26:27,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:26:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:26:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:26:30,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:26:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924520098] [2024-11-19 00:26:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924520098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:26:30,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:26:30,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:26:30,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016255000] [2024-11-19 00:26:30,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:26:30,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:26:30,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:26:30,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:26:30,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:26:30,216 INFO L87 Difference]: Start difference. First operand 89 states and 132 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:26:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:26:30,611 INFO L93 Difference]: Finished difference Result 126 states and 178 transitions. [2024-11-19 00:26:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:26:30,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-19 00:26:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:26:30,614 INFO L225 Difference]: With dead ends: 126 [2024-11-19 00:26:30,614 INFO L226 Difference]: Without dead ends: 124 [2024-11-19 00:26:30,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:26:30,615 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 59 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:26:30,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 309 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:26:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-19 00:26:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2024-11-19 00:26:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:26:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 132 transitions. [2024-11-19 00:26:30,631 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 132 transitions. Word has length 113 [2024-11-19 00:26:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:26:30,632 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 132 transitions. [2024-11-19 00:26:30,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:26:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2024-11-19 00:26:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 00:26:30,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:26:30,634 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:26:30,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:26:30,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:26:30,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:26:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1301901591, now seen corresponding path program 1 times [2024-11-19 00:26:30,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:26:30,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268529869] [2024-11-19 00:26:30,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:26:30,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:26:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:26:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-19 00:26:36,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:26:36,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268529869] [2024-11-19 00:26:36,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268529869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:26:36,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:26:36,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:26:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69092164] [2024-11-19 00:26:36,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:26:36,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:26:36,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:26:36,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:26:36,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:26:36,278 INFO L87 Difference]: Start difference. First operand 89 states and 132 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:26:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:26:37,207 INFO L93 Difference]: Finished difference Result 105 states and 153 transitions. [2024-11-19 00:26:37,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:26:37,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-19 00:26:37,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:26:37,212 INFO L225 Difference]: With dead ends: 105 [2024-11-19 00:26:37,212 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 00:26:37,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:26:37,214 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 29 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:26:37,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 265 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:26:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 00:26:37,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2024-11-19 00:26:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:26:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-19 00:26:37,235 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 113 [2024-11-19 00:26:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:26:37,236 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-19 00:26:37,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:26:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-19 00:26:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-19 00:26:37,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:26:37,246 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:26:37,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:26:37,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:26:37,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:26:37,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2008703854, now seen corresponding path program 1 times [2024-11-19 00:26:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:26:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802860792] [2024-11-19 00:26:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:26:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:26:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:26:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2024-11-19 00:26:40,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:26:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802860792] [2024-11-19 00:26:40,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802860792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:26:40,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:26:40,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:26:40,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728785208] [2024-11-19 00:26:40,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:26:40,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:26:40,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:26:40,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:26:40,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:26:40,562 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:26:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:26:41,916 INFO L93 Difference]: Finished difference Result 130 states and 184 transitions. [2024-11-19 00:26:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 00:26:41,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 222 [2024-11-19 00:26:41,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:26:41,918 INFO L225 Difference]: With dead ends: 130 [2024-11-19 00:26:41,918 INFO L226 Difference]: Without dead ends: 128 [2024-11-19 00:26:41,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2024-11-19 00:26:41,920 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 83 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:26:41,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 303 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:26:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-19 00:26:41,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2024-11-19 00:26:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 00:26:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-19 00:26:41,933 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 222 [2024-11-19 00:26:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:26:41,933 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-19 00:26:41,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:26:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-19 00:26:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-19 00:26:41,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:26:41,936 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:26:41,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:26:41,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:26:41,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:26:41,937 INFO L85 PathProgramCache]: Analyzing trace with hash -926203706, now seen corresponding path program 1 times [2024-11-19 00:26:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:26:41,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967226118] [2024-11-19 00:26:41,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:26:41,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:26:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:26:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2024-11-19 00:26:44,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:26:44,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967226118] [2024-11-19 00:26:44,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967226118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:26:44,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:26:44,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:26:44,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739940957] [2024-11-19 00:26:44,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:26:44,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:26:44,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:26:44,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:26:44,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:26:44,152 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:26:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:26:44,651 INFO L93 Difference]: Finished difference Result 114 states and 165 transitions. [2024-11-19 00:26:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:26:44,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 223 [2024-11-19 00:26:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:26:44,653 INFO L225 Difference]: With dead ends: 114 [2024-11-19 00:26:44,653 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 00:26:44,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:26:44,655 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 44 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:26:44,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 299 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:26:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 00:26:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 00:26:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 00:26:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 00:26:44,656 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2024-11-19 00:26:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:26:44,657 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 00:26:44,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 00:26:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 00:26:44,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 00:26:44,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:26:44,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:26:44,667 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:26:44,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 00:26:45,169 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:26:45,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:26:45 BoogieIcfgContainer [2024-11-19 00:26:45,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:26:45,217 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:26:45,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:26:45,218 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:26:45,218 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:26:21" (3/4) ... [2024-11-19 00:26:45,221 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 00:26:45,225 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-19 00:26:45,233 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-19 00:26:45,233 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 00:26:45,233 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 00:26:45,234 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 00:26:45,338 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 00:26:45,338 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 00:26:45,338 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:26:45,339 INFO L158 Benchmark]: Toolchain (without parser) took 24703.64ms. Allocated memory was 155.2MB in the beginning and 740.3MB in the end (delta: 585.1MB). Free memory was 99.0MB in the beginning and 557.9MB in the end (delta: -459.0MB). Peak memory consumption was 130.7MB. Max. memory is 16.1GB. [2024-11-19 00:26:45,339 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:26:45,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.64ms. Allocated memory is still 155.2MB. Free memory was 98.6MB in the beginning and 83.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:26:45,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.61ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 82.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:26:45,340 INFO L158 Benchmark]: Boogie Preprocessor took 38.23ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 80.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:26:45,340 INFO L158 Benchmark]: RCFGBuilder took 459.30ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 79.7MB in the beginning and 169.3MB in the end (delta: -89.5MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-19 00:26:45,340 INFO L158 Benchmark]: TraceAbstraction took 23732.11ms. Allocated memory was 203.4MB in the beginning and 740.3MB in the end (delta: 536.9MB). Free memory was 169.3MB in the beginning and 564.2MB in the end (delta: -394.9MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. [2024-11-19 00:26:45,341 INFO L158 Benchmark]: Witness Printer took 120.98ms. Allocated memory is still 740.3MB. Free memory was 564.2MB in the beginning and 557.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 00:26:45,342 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.21ms. Allocated memory is still 155.2MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.64ms. Allocated memory is still 155.2MB. Free memory was 98.6MB in the beginning and 83.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.61ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 82.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.23ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 80.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.30ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 79.7MB in the beginning and 169.3MB in the end (delta: -89.5MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 23732.11ms. Allocated memory was 203.4MB in the beginning and 740.3MB in the end (delta: 536.9MB). Free memory was 169.3MB in the beginning and 564.2MB in the end (delta: -394.9MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. * Witness Printer took 120.98ms. Allocated memory is still 740.3MB. Free memory was 564.2MB in the beginning and 557.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 7, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 1726 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1281 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 684 IncrementalHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 445 mSDtfsCounter, 684 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=5, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 117 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 1116 NumberOfCodeBlocks, 1116 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1108 ConstructedInterpolants, 0 QuantifiedInterpolants, 3843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 263 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 8750/8784 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((last_1_var_1_7 < 3) || (var_1_12 == last_1_var_1_7)) || (0 < ((long long) last_1_var_1_1 + last_1_var_1_7))) || ((var_1_15 == 0) && (var_1_16 == 0))) && ((((((last_1_var_1_7 < 3) || (last_1_var_1_7 < last_1_var_1_1)) || (var_1_12 == last_1_var_1_7)) || ((var_1_15 == 0) && (var_1_16 == 0))) && ((((((((var_1_14 * 65535) + var_1_13) >= 0) ? (((var_1_14 * 65535) + var_1_13) % 65536) : ((((var_1_14 * 65535) + var_1_13) % 65536) + 65536)) == var_1_12) || (32767 < ((((var_1_14 * 65535) + var_1_13) >= 0) ? (((var_1_14 * 65535) + var_1_13) % 65536) : ((((var_1_14 * 65535) + var_1_13) % 65536) + 65536)))) && ((((((var_1_14 * 65535) + var_1_13) >= 0) ? (((var_1_14 * 65535) + var_1_13) % 65536) : ((((var_1_14 * 65535) + var_1_13) % 65536) + 65536)) < 32768) || (((((var_1_14 * 65535) + var_1_13) >= 0) ? (((var_1_14 * 65535) + var_1_13) % 65536) : ((((var_1_14 * 65535) + var_1_13) % 65536) + 65536)) == (65536 + var_1_12)))) || (last_1_var_1_1 < (last_1_var_1_7 + 1)))) || (((long long) last_1_var_1_1 + last_1_var_1_7) < 1))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (last_1_var_1_1 == \old(last_1_var_1_1))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_12 == \old(last_1_var_1_12))) RESULT: Ultimate proved your program to be correct! [2024-11-19 00:26:45,396 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 Writing output log to file Ultimate.log Result: TRUE