./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/for_bounded_loop1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/loops/for_bounded_loop1.c -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 d362508cc6d10100af1abe34073a764b50319c9e1ae9c7cc9c70a242e3f5c8c4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:56:58,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:56:58,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 00:56:58,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:56:58,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:56:58,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:56:58,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:56:58,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:56:58,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:56:58,706 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:56:58,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:56:58,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:56:58,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:56:58,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:56:58,708 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:56:58,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:56:58,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:56:58,709 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:56:58,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 00:56:58,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:56:58,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:56:58,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:56:58,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:56:58,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:56:58,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:56:58,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:56:58,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:56:58,713 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:56:58,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:56:58,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:56:58,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:56:58,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:56:58,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:56:58,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:56:58,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:56:58,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:56:58,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 00:56:58,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 00:56:58,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:56:58,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:56:58,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:56:58,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:56:58,716 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 -> d362508cc6d10100af1abe34073a764b50319c9e1ae9c7cc9c70a242e3f5c8c4 [2024-11-22 00:56:58,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:56:58,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:56:58,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:56:58,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:56:58,968 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:56:58,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/for_bounded_loop1.c [2024-11-22 00:57:00,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:57:00,448 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:57:00,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/for_bounded_loop1.c [2024-11-22 00:57:00,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957000d66/2e17accd0c924b3395e751161aa5900b/FLAG774310530 [2024-11-22 00:57:00,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957000d66/2e17accd0c924b3395e751161aa5900b [2024-11-22 00:57:00,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:57:00,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:57:00,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:57:00,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:57:00,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:57:00,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3844bf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00, skipping insertion in model container [2024-11-22 00:57:00,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:57:00,698 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/loops/for_bounded_loop1.c[416,429] [2024-11-22 00:57:00,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:57:00,732 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:57:00,745 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/loops/for_bounded_loop1.c[416,429] [2024-11-22 00:57:00,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:57:00,792 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:57:00,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00 WrapperNode [2024-11-22 00:57:00,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:57:00,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:57:00,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:57:00,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:57:00,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,817 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2024-11-22 00:57:00,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:57:00,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:57:00,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:57:00,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:57:00,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,836 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-22 00:57:00,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:57:00,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:57:00,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:57:00,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:57:00,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (1/1) ... [2024-11-22 00:57:00,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:57:00,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:57:00,867 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-22 00:57:00,869 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-22 00:57:00,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:57:00,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 00:57:00,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:57:00,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:57:00,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 00:57:00,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 00:57:00,944 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:57:00,946 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:57:01,049 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-22 00:57:01,049 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:57:01,065 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:57:01,065 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 00:57:01,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:57:01 BoogieIcfgContainer [2024-11-22 00:57:01,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:57:01,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:57:01,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:57:01,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:57:01,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:57:00" (1/3) ... [2024-11-22 00:57:01,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f12b0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:57:01, skipping insertion in model container [2024-11-22 00:57:01,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:57:00" (2/3) ... [2024-11-22 00:57:01,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f12b0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:57:01, skipping insertion in model container [2024-11-22 00:57:01,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:57:01" (3/3) ... [2024-11-22 00:57:01,074 INFO L112 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2024-11-22 00:57:01,087 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:57:01,088 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 00:57:01,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:57:01,143 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;@6b21582c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:57:01,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 00:57:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 00:57:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 00:57:01,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:57:01,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:57:01,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:57:01,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:57:01,157 INFO L85 PathProgramCache]: Analyzing trace with hash 194354858, now seen corresponding path program 1 times [2024-11-22 00:57:01,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:57:01,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493594326] [2024-11-22 00:57:01,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:57:01,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:57:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:57:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:57:01,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:57:01,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493594326] [2024-11-22 00:57:01,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493594326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:57:01,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:57:01,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 00:57:01,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400842232] [2024-11-22 00:57:01,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:57:01,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 00:57:01,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:57:01,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 00:57:01,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:57:01,308 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:57:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:57:01,323 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2024-11-22 00:57:01,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 00:57:01,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 00:57:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:57:01,331 INFO L225 Difference]: With dead ends: 35 [2024-11-22 00:57:01,331 INFO L226 Difference]: Without dead ends: 16 [2024-11-22 00:57:01,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-22 00:57:01,336 INFO L432 NwaCegarLoop]: 23 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, 23 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-22 00:57:01,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:57:01,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-22 00:57:01,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-22 00:57:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:57:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-22 00:57:01,363 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2024-11-22 00:57:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:57:01,363 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-22 00:57:01,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:57:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-22 00:57:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 00:57:01,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:57:01,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:57:01,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 00:57:01,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:57:01,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:57:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash 181425564, now seen corresponding path program 1 times [2024-11-22 00:57:01,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:57:01,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549936925] [2024-11-22 00:57:01,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:57:01,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:57:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:57:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:57:01,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:57:01,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549936925] [2024-11-22 00:57:01,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549936925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:57:01,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:57:01,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:57:01,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740996639] [2024-11-22 00:57:01,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:57:01,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:57:01,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:57:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:57:01,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:57:01,448 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:57:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:57:01,464 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-22 00:57:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:57:01,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 00:57:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:57:01,466 INFO L225 Difference]: With dead ends: 29 [2024-11-22 00:57:01,466 INFO L226 Difference]: Without dead ends: 22 [2024-11-22 00:57:01,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 00:57:01,467 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:57:01,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 29 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:57:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-22 00:57:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2024-11-22 00:57:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 00:57:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-22 00:57:01,472 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 8 [2024-11-22 00:57:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:57:01,472 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-22 00:57:01,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:57:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-22 00:57:01,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 00:57:01,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:57:01,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:57:01,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 00:57:01,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:57:01,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:57:01,474 INFO L85 PathProgramCache]: Analyzing trace with hash 183153442, now seen corresponding path program 1 times [2024-11-22 00:57:01,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:57:01,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393843709] [2024-11-22 00:57:01,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:57:01,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:57:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:57:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:57:01,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:57:01,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393843709] [2024-11-22 00:57:01,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393843709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:57:01,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:57:01,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 00:57:01,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169256585] [2024-11-22 00:57:01,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:57:01,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 00:57:01,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:57:01,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 00:57:01,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 00:57:01,626 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:57:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:57:01,671 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-22 00:57:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 00:57:01,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 00:57:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:57:01,672 INFO L225 Difference]: With dead ends: 26 [2024-11-22 00:57:01,672 INFO L226 Difference]: Without dead ends: 24 [2024-11-22 00:57:01,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:57:01,674 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:57:01,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 58 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:57:01,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-22 00:57:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-22 00:57:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 00:57:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-22 00:57:01,679 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2024-11-22 00:57:01,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:57:01,679 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-22 00:57:01,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:57:01,679 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-22 00:57:01,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 00:57:01,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:57:01,680 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:57:01,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 00:57:01,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:57:01,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:57:01,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1335896453, now seen corresponding path program 1 times [2024-11-22 00:57:01,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:57:01,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586625535] [2024-11-22 00:57:01,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:57:01,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:57:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:57:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:57:01,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:57:01,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586625535] [2024-11-22 00:57:01,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586625535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:57:01,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:57:01,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 00:57:01,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508102500] [2024-11-22 00:57:01,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:57:01,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 00:57:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:57:01,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 00:57:01,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 00:57:01,899 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 00:57:01,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:57:01,994 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-22 00:57:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 00:57:01,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-22 00:57:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:57:01,998 INFO L225 Difference]: With dead ends: 34 [2024-11-22 00:57:01,998 INFO L226 Difference]: Without dead ends: 32 [2024-11-22 00:57:01,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-22 00:57:01,999 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:57:02,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 67 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:57:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-22 00:57:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-22 00:57:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 00:57:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-22 00:57:02,010 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 15 [2024-11-22 00:57:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:57:02,010 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-22 00:57:02,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 00:57:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-22 00:57:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 00:57:02,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:57:02,011 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:57:02,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 00:57:02,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:57:02,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:57:02,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1291608463, now seen corresponding path program 1 times [2024-11-22 00:57:02,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:57:02,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805963422] [2024-11-22 00:57:02,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:57:02,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:57:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:57:02,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 00:57:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 00:57:02,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 00:57:02,051 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 00:57:02,052 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 00:57:02,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 00:57:02,057 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-22 00:57:02,072 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 00:57:02,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:57:02 BoogieIcfgContainer [2024-11-22 00:57:02,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 00:57:02,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 00:57:02,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 00:57:02,079 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 00:57:02,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:57:01" (3/4) ... [2024-11-22 00:57:02,080 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 00:57:02,112 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 00:57:02,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 00:57:02,112 INFO L158 Benchmark]: Toolchain (without parser) took 1631.38ms. Allocated memory is still 192.9MB. Free memory was 128.8MB in the beginning and 151.4MB in the end (delta: -22.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:57:02,112 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:57:02,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.24ms. Allocated memory is still 192.9MB. Free memory was 128.8MB in the beginning and 160.1MB in the end (delta: -31.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 00:57:02,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.97ms. Allocated memory is still 192.9MB. Free memory was 160.1MB in the beginning and 158.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:57:02,113 INFO L158 Benchmark]: Boogie Preprocessor took 24.43ms. Allocated memory is still 192.9MB. Free memory was 158.8MB in the beginning and 156.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:57:02,113 INFO L158 Benchmark]: RCFGBuilder took 222.54ms. Allocated memory is still 192.9MB. Free memory was 156.8MB in the beginning and 147.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-22 00:57:02,114 INFO L158 Benchmark]: TraceAbstraction took 1009.75ms. Allocated memory is still 192.9MB. Free memory was 146.3MB in the beginning and 153.5MB in the end (delta: -7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 00:57:02,114 INFO L158 Benchmark]: Witness Printer took 33.61ms. Allocated memory is still 192.9MB. Free memory was 153.5MB in the beginning and 151.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 00:57:02,115 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.16ms. Allocated memory is still 96.5MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.24ms. Allocated memory is still 192.9MB. Free memory was 128.8MB in the beginning and 160.1MB in the end (delta: -31.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.97ms. Allocated memory is still 192.9MB. Free memory was 160.1MB in the beginning and 158.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.43ms. Allocated memory is still 192.9MB. Free memory was 158.8MB in the beginning and 156.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 222.54ms. Allocated memory is still 192.9MB. Free memory was 156.8MB in the beginning and 147.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1009.75ms. Allocated memory is still 192.9MB. Free memory was 146.3MB in the beginning and 153.5MB in the end (delta: -7.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 33.61ms. Allocated memory is still 192.9MB. Free memory was 153.5MB in the beginning and 151.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 11]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int i=0, x=0, y=0; [L20] int n=__VERIFIER_nondet_int(); [L21] COND FALSE !(!(n>0)) [L22] i=0 VAL [i=0, n=1, x=0, y=0] [L22] COND TRUE i