./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/for_bounded_loop1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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 /storage/repos/ultimate/releaseScripts/default/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-mul-div-a046e57-m [2024-10-12 18:28:06,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:28:07,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:28:07,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:28:07,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:28:07,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:28:07,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:28:07,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:28:07,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:28:07,055 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:28:07,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:28:07,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:28:07,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:28:07,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:28:07,057 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:28:07,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:28:07,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:28:07,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:28:07,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:28:07,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:28:07,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:28:07,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:28:07,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:28:07,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:28:07,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:28:07,063 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:28:07,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:28:07,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:28:07,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:28:07,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:28:07,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:28:07,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:28:07,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:28:07,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:28:07,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:28:07,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:28:07,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:28:07,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:28:07,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:28:07,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:28:07,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:28:07,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:28:07,067 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-10-12 18:28:07,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:28:07,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:28:07,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:28:07,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:28:07,357 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:28:07,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/for_bounded_loop1.c [2024-10-12 18:28:08,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:28:09,166 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:28:09,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/for_bounded_loop1.c [2024-10-12 18:28:09,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69036af7d/7e6d7d6ba0984b238ca8111580e1b09d/FLAG048b49880 [2024-10-12 18:28:09,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69036af7d/7e6d7d6ba0984b238ca8111580e1b09d [2024-10-12 18:28:09,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:28:09,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:28:09,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:28:09,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:28:09,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:28:09,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d6b0886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09, skipping insertion in model container [2024-10-12 18:28:09,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:28:09,541 WARN L248 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-10-12 18:28:09,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:28:09,570 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:28:09,582 WARN L248 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-10-12 18:28:09,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:28:09,604 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:28:09,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09 WrapperNode [2024-10-12 18:28:09,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:28:09,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:28:09,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:28:09,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:28:09,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,637 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2024-10-12 18:28:09,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:28:09,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:28:09,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:28:09,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:28:09,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,668 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-10-12 18:28:09,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:28:09,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:28:09,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:28:09,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:28:09,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (1/1) ... [2024-10-12 18:28:09,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:28:09,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:28:09,723 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-10-12 18:28:09,730 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-10-12 18:28:09,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:28:09,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:28:09,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:28:09,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:28:09,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 18:28:09,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 18:28:09,850 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:28:09,852 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:28:09,967 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-12 18:28:09,968 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:28:10,004 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:28:10,009 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 18:28:10,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:28:10 BoogieIcfgContainer [2024-10-12 18:28:10,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:28:10,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:28:10,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:28:10,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:28:10,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:28:09" (1/3) ... [2024-10-12 18:28:10,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b689d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:28:10, skipping insertion in model container [2024-10-12 18:28:10,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:28:09" (2/3) ... [2024-10-12 18:28:10,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b689d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:28:10, skipping insertion in model container [2024-10-12 18:28:10,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:28:10" (3/3) ... [2024-10-12 18:28:10,022 INFO L112 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2024-10-12 18:28:10,041 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:28:10,041 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:28:10,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:28:10,113 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;@7123cf2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:28:10,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:28:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 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-10-12 18:28:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 18:28:10,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:28:10,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:28:10,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:28:10,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:28:10,137 INFO L85 PathProgramCache]: Analyzing trace with hash -899843912, now seen corresponding path program 1 times [2024-10-12 18:28:10,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:28:10,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638329361] [2024-10-12 18:28:10,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:28:10,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:28:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:28:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:28:10,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:28:10,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638329361] [2024-10-12 18:28:10,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638329361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:28:10,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:28:10,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:28:10,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380965007] [2024-10-12 18:28:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:28:10,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:28:10,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:28:10,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:28:10,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:28:10,357 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 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.0) internal successors, (6), 2 states have internal predecessors, (6), 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-10-12 18:28:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:28:10,386 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2024-10-12 18:28:10,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:28:10,390 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2024-10-12 18:28:10,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:28:10,396 INFO L225 Difference]: With dead ends: 32 [2024-10-12 18:28:10,396 INFO L226 Difference]: Without dead ends: 15 [2024-10-12 18:28:10,400 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-10-12 18:28:10,406 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:28:10,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:28:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-12 18:28:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-12 18:28:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 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-10-12 18:28:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-10-12 18:28:10,458 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 7 [2024-10-12 18:28:10,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:28:10,459 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-12 18:28:10,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-10-12 18:28:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-10-12 18:28:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 18:28:10,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:28:10,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:28:10,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:28:10,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:28:10,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:28:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash -912773206, now seen corresponding path program 1 times [2024-10-12 18:28:10,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:28:10,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463990921] [2024-10-12 18:28:10,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:28:10,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:28:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:28:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:28:10,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:28:10,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463990921] [2024-10-12 18:28:10,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463990921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:28:10,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:28:10,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:28:10,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570511871] [2024-10-12 18:28:10,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:28:10,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:28:10,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:28:10,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:28:10,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:28:10,616 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-12 18:28:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:28:10,642 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-10-12 18:28:10,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:28:10,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-10-12 18:28:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:28:10,644 INFO L225 Difference]: With dead ends: 28 [2024-10-12 18:28:10,644 INFO L226 Difference]: Without dead ends: 21 [2024-10-12 18:28:10,644 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-10-12 18:28:10,646 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:28:10,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 26 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:28:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-12 18:28:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2024-10-12 18:28:10,652 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-10-12 18:28:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-10-12 18:28:10,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 7 [2024-10-12 18:28:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:28:10,654 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-10-12 18:28:10,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-12 18:28:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-10-12 18:28:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 18:28:10,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:28:10,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:28:10,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:28:10,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:28:10,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:28:10,656 INFO L85 PathProgramCache]: Analyzing trace with hash -911045328, now seen corresponding path program 1 times [2024-10-12 18:28:10,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:28:10,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037475498] [2024-10-12 18:28:10,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:28:10,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:28:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:28:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:28:10,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:28:10,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037475498] [2024-10-12 18:28:10,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037475498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:28:10,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:28:10,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:28:10,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842175923] [2024-10-12 18:28:10,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:28:10,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:28:10,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:28:10,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:28:10,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:28:10,868 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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-10-12 18:28:10,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:28:10,950 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-10-12 18:28:10,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:28:10,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2024-10-12 18:28:10,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:28:10,952 INFO L225 Difference]: With dead ends: 25 [2024-10-12 18:28:10,953 INFO L226 Difference]: Without dead ends: 23 [2024-10-12 18:28:10,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10-12 18:28:10,956 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:28:10,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 50 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:28:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-12 18:28:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-12 18:28:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 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-10-12 18:28:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-10-12 18:28:10,967 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 7 [2024-10-12 18:28:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:28:10,967 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-10-12 18:28:10,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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-10-12 18:28:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-10-12 18:28:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 18:28:10,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:28:10,969 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:28:10,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:28:10,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:28:10,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:28:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash 562004919, now seen corresponding path program 1 times [2024-10-12 18:28:10,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:28:10,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894066868] [2024-10-12 18:28:10,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:28:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:28:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:28:11,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:28:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:28:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:28:11,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:28:11,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894066868] [2024-10-12 18:28:11,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894066868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:28:11,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:28:11,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 18:28:11,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692498728] [2024-10-12 18:28:11,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:28:11,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 18:28:11,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:28:11,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 18:28:11,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:28:11,228 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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-10-12 18:28:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:28:11,360 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-10-12 18:28:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:28:11,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 14 [2024-10-12 18:28:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:28:11,362 INFO L225 Difference]: With dead ends: 33 [2024-10-12 18:28:11,362 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 18:28:11,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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-10-12 18:28:11,366 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:28:11,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:28:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 18:28:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-12 18:28:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 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-10-12 18:28:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-10-12 18:28:11,378 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 14 [2024-10-12 18:28:11,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:28:11,379 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-10-12 18:28:11,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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-10-12 18:28:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-10-12 18:28:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 18:28:11,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:28:11,381 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:28:11,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 18:28:11,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:28:11,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:28:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1275447295, now seen corresponding path program 1 times [2024-10-12 18:28:11,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:28:11,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376545344] [2024-10-12 18:28:11,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:28:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:28:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:28:11,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 18:28:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:28:11,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 18:28:11,451 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 18:28:11,452 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:28:11,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:28:11,458 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-12 18:28:11,484 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:28:11,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:28:11 BoogieIcfgContainer [2024-10-12 18:28:11,490 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:28:11,490 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:28:11,491 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:28:11,491 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:28:11,491 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:28:10" (3/4) ... [2024-10-12 18:28:11,493 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 18:28:11,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 18:28:11,549 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:28:11,550 INFO L158 Benchmark]: Toolchain (without parser) took 2349.63ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 115.4MB in the end (delta: -30.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:28:11,550 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:28:11,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.62ms. Allocated memory is still 155.2MB. Free memory was 84.9MB in the beginning and 122.5MB in the end (delta: -37.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-10-12 18:28:11,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.05ms. Allocated memory is still 155.2MB. Free memory was 122.5MB in the beginning and 121.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:28:11,551 INFO L158 Benchmark]: Boogie Preprocessor took 44.05ms. Allocated memory is still 155.2MB. Free memory was 121.0MB in the beginning and 119.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:28:11,551 INFO L158 Benchmark]: RCFGBuilder took 326.73ms. Allocated memory is still 155.2MB. Free memory was 119.5MB in the beginning and 107.8MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 18:28:11,551 INFO L158 Benchmark]: TraceAbstraction took 1476.92ms. Allocated memory is still 155.2MB. Free memory was 107.3MB in the beginning and 117.5MB in the end (delta: -10.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:28:11,551 INFO L158 Benchmark]: Witness Printer took 58.98ms. Allocated memory is still 155.2MB. Free memory was 117.3MB in the beginning and 115.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:28:11,556 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.62ms. Allocated memory is still 155.2MB. Free memory was 84.9MB in the beginning and 122.5MB in the end (delta: -37.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.05ms. Allocated memory is still 155.2MB. Free memory was 122.5MB in the beginning and 121.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.05ms. Allocated memory is still 155.2MB. Free memory was 121.0MB in the beginning and 119.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 326.73ms. Allocated memory is still 155.2MB. Free memory was 119.5MB in the beginning and 107.8MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1476.92ms. Allocated memory is still 155.2MB. Free memory was 107.3MB in the beginning and 117.5MB in the end (delta: -10.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 58.98ms. Allocated memory is still 155.2MB. Free memory was 117.3MB in the beginning and 115.4MB in the end (delta: 1.8MB). 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