./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_b3_o5.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ca4ee3dd Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id2_b3_o5.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 bfa501ca93fc9b0e6d760bbe690b8b09cdd28cd292bfa547a39097dc8f6d3704 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-ca4ee3d-m [2024-09-20 19:50:54,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:50:54,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 19:50:54,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:50:54,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:50:54,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:50:54,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:50:54,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:50:54,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:50:54,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:50:54,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:50:54,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:50:54,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:50:54,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:50:54,810 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:50:54,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:50:54,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:50:54,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:50:54,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 19:50:54,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:50:54,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:50:54,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:50:54,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:50:54,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:50:54,815 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:50:54,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:50:54,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:50:54,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:50:54,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:50:54,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:50:54,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:50:54,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:50:54,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:50:54,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:50:54,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:50:54,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:50:54,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 19:50:54,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 19:50:54,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:50:54,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:50:54,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:50:54,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:50:54,821 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> bfa501ca93fc9b0e6d760bbe690b8b09cdd28cd292bfa547a39097dc8f6d3704 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 19:50:55,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:50:55,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:50:55,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:50:55,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:50:55,100 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:50:55,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id2_b3_o5.c [2024-09-20 19:50:56,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:50:56,688 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:50:56,690 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b3_o5.c [2024-09-20 19:50:56,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/9ca3b00a3/76e1e1af0f254ea1a4a7c00ec3b946aa/FLAG5bf4a6aea [2024-09-20 19:50:56,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/9ca3b00a3/76e1e1af0f254ea1a4a7c00ec3b946aa [2024-09-20 19:50:56,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:50:56,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:50:56,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:50:56,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:50:56,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:50:56,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:56,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c4dc3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56, skipping insertion in model container [2024-09-20 19:50:56,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:56,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:50:56,941 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b3_o5.c[771,784] [2024-09-20 19:50:56,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:50:56,961 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:50:56,975 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b3_o5.c[771,784] [2024-09-20 19:50:56,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:50:56,991 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:50:56,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56 WrapperNode [2024-09-20 19:50:56,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:50:56,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:50:56,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:50:56,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:50:57,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:57,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:57,012 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:50:57,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:50:57,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:50:57,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:50:57,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:50:57,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:57,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:57,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:57,036 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-09-20 19:50:57,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:57,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:57,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:57,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:57,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:57,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:57,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:50:57,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:50:57,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:50:57,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:50:57,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (1/1) ... [2024-09-20 19:50:57,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:50:57,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:50:57,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 19:50:57,089 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 19:50:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:50:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:50:57,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:50:57,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 19:50:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:50:57,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:50:57,127 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2024-09-20 19:50:57,128 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2024-09-20 19:50:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:50:57,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:50:57,129 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-09-20 19:50:57,129 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-09-20 19:50:57,186 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:50:57,188 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:50:57,309 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-20 19:50:57,309 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:50:57,330 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:50:57,330 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-20 19:50:57,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:50:57 BoogieIcfgContainer [2024-09-20 19:50:57,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:50:57,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:50:57,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:50:57,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:50:57,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:50:56" (1/3) ... [2024-09-20 19:50:57,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703140a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:50:57, skipping insertion in model container [2024-09-20 19:50:57,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:50:56" (2/3) ... [2024-09-20 19:50:57,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703140a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:50:57, skipping insertion in model container [2024-09-20 19:50:57,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:50:57" (3/3) ... [2024-09-20 19:50:57,339 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b3_o5.c [2024-09-20 19:50:57,358 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:50:57,359 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:50:57,418 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:50:57,424 INFO L336 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=All, 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;@9d52261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:50:57,424 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:50:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-20 19:50:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-20 19:50:57,434 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:57,435 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:57,435 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:57,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1111832961, now seen corresponding path program 1 times [2024-09-20 19:50:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:57,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787183697] [2024-09-20 19:50:57,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:57,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:57,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 19:50:57,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:57,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787183697] [2024-09-20 19:50:57,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787183697] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:50:57,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:50:57,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 19:50:57,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542092976] [2024-09-20 19:50:57,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:50:57,825 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:50:57,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:57,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:50:57,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:50:57,847 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 19:50:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:57,894 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-09-20 19:50:57,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:50:57,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2024-09-20 19:50:57,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:57,905 INFO L225 Difference]: With dead ends: 38 [2024-09-20 19:50:57,905 INFO L226 Difference]: Without dead ends: 26 [2024-09-20 19:50:57,908 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:50:57,913 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:57,915 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:50:57,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-20 19:50:57,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-20 19:50:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-20 19:50:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-09-20 19:50:57,961 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2024-09-20 19:50:57,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:57,962 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-09-20 19:50:57,962 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 19:50:57,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-09-20 19:50:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-20 19:50:57,966 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:57,966 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:57,967 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 19:50:57,967 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:57,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:57,970 INFO L85 PathProgramCache]: Analyzing trace with hash 116299484, now seen corresponding path program 1 times [2024-09-20 19:50:57,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:57,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540139111] [2024-09-20 19:50:57,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:57,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,257 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 19:50:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 19:50:58,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:58,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540139111] [2024-09-20 19:50:58,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540139111] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:50:58,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:50:58,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 19:50:58,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022461562] [2024-09-20 19:50:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:50:58,304 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:50:58,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:58,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:50:58,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:50:58,307 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 19:50:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:58,344 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-09-20 19:50:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:50:58,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-09-20 19:50:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:58,346 INFO L225 Difference]: With dead ends: 42 [2024-09-20 19:50:58,346 INFO L226 Difference]: Without dead ends: 30 [2024-09-20 19:50:58,347 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:50:58,348 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:58,349 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:50:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-20 19:50:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-20 19:50:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-20 19:50:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-20 19:50:58,362 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2024-09-20 19:50:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:58,363 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-20 19:50:58,363 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 19:50:58,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-20 19:50:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-20 19:50:58,367 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:58,367 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:58,367 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 19:50:58,367 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:58,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash 144928635, now seen corresponding path program 1 times [2024-09-20 19:50:58,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:58,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154480085] [2024-09-20 19:50:58,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:58,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 19:50:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 19:50:58,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:58,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154480085] [2024-09-20 19:50:58,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154480085] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:50:58,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:50:58,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-20 19:50:58,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924086021] [2024-09-20 19:50:58,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:50:58,641 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 19:50:58,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:58,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 19:50:58,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-20 19:50:58,644 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 19:50:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:58,699 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-09-20 19:50:58,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 19:50:58,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-09-20 19:50:58,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:58,701 INFO L225 Difference]: With dead ends: 36 [2024-09-20 19:50:58,701 INFO L226 Difference]: Without dead ends: 32 [2024-09-20 19:50:58,703 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-20 19:50:58,704 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:58,708 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:50:58,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-20 19:50:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-20 19:50:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-20 19:50:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-20 19:50:58,719 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2024-09-20 19:50:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:58,720 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-20 19:50:58,721 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 19:50:58,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-20 19:50:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-20 19:50:58,723 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:58,723 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:58,724 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 19:50:58,724 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:58,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:58,724 INFO L85 PathProgramCache]: Analyzing trace with hash -439299749, now seen corresponding path program 1 times [2024-09-20 19:50:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:58,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980600105] [2024-09-20 19:50:58,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:58,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 19:50:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 19:50:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 19:50:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980600105] [2024-09-20 19:50:58,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980600105] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:50:58,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:50:58,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 19:50:58,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255684528] [2024-09-20 19:50:58,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:50:58,879 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:50:58,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:58,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:50:58,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:50:58,880 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 19:50:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:58,901 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-09-20 19:50:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:50:58,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-20 19:50:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:58,902 INFO L225 Difference]: With dead ends: 46 [2024-09-20 19:50:58,902 INFO L226 Difference]: Without dead ends: 34 [2024-09-20 19:50:58,903 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:50:58,904 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:58,905 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:50:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-20 19:50:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-20 19:50:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-20 19:50:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-20 19:50:58,912 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2024-09-20 19:50:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:58,913 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-20 19:50:58,913 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 19:50:58,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-20 19:50:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-20 19:50:58,915 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:58,915 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:58,915 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 19:50:58,915 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:58,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:58,916 INFO L85 PathProgramCache]: Analyzing trace with hash -635813254, now seen corresponding path program 1 times [2024-09-20 19:50:58,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:58,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882857096] [2024-09-20 19:50:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:58,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:58,997 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:59,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 19:50:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:59,107 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 19:50:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 19:50:59,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:59,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882857096] [2024-09-20 19:50:59,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882857096] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:50:59,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:50:59,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-20 19:50:59,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184291079] [2024-09-20 19:50:59,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:50:59,128 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 19:50:59,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:59,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 19:50:59,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-20 19:50:59,129 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 19:50:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:59,183 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2024-09-20 19:50:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 19:50:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-20 19:50:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:59,185 INFO L225 Difference]: With dead ends: 50 [2024-09-20 19:50:59,187 INFO L226 Difference]: Without dead ends: 38 [2024-09-20 19:50:59,187 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-20 19:50:59,188 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:59,191 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:50:59,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-20 19:50:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-20 19:50:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-20 19:50:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-09-20 19:50:59,202 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 27 [2024-09-20 19:50:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:59,202 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-09-20 19:50:59,203 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 19:50:59,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-09-20 19:50:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-20 19:50:59,205 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:50:59,205 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:50:59,206 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 19:50:59,206 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:50:59,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash -607184103, now seen corresponding path program 1 times [2024-09-20 19:50:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:50:59,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064366986] [2024-09-20 19:50:59,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:59,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:50:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:59,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:50:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:59,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:50:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:59,348 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 19:50:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:59,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 19:50:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 19:50:59,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:50:59,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064366986] [2024-09-20 19:50:59,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064366986] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:50:59,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307598836] [2024-09-20 19:50:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:50:59,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:50:59,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:50:59,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 19:50:59,416 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 19:50:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:50:59,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-20 19:50:59,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:50:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 19:50:59,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:50:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 19:50:59,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307598836] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 19:50:59,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:50:59,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 11] total 15 [2024-09-20 19:50:59,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442834377] [2024-09-20 19:50:59,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:50:59,673 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:50:59,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:50:59,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:50:59,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-20 19:50:59,674 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 19:50:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:50:59,695 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-09-20 19:50:59,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:50:59,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-20 19:50:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:50:59,698 INFO L225 Difference]: With dead ends: 38 [2024-09-20 19:50:59,698 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 19:50:59,699 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-20 19:50:59,700 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:50:59,702 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 19:50:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 19:50:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 19:50:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 19:50:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 19:50:59,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2024-09-20 19:50:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:50:59,703 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 19:50:59,703 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 19:50:59,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:50:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 19:50:59,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 19:50:59,707 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 19:50:59,724 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 19:50:59,911 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-20 19:50:59,914 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-20 19:50:59,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 19:50:59,991 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 19:51:00,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 07:51:00 BoogieIcfgContainer [2024-09-20 19:51:00,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 19:51:00,008 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 19:51:00,008 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 19:51:00,009 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 19:51:00,009 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:50:57" (3/4) ... [2024-09-20 19:51:00,011 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 19:51:00,056 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 19:51:00,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 19:51:00,057 INFO L158 Benchmark]: Toolchain (without parser) took 3325.72ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 143.7MB in the beginning and 158.8MB in the end (delta: -15.1MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-09-20 19:51:00,057 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:51:00,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.82ms. Allocated memory is still 176.2MB. Free memory was 143.7MB in the beginning and 132.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-20 19:51:00,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.47ms. Allocated memory is still 176.2MB. Free memory was 132.4MB in the beginning and 131.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:51:00,058 INFO L158 Benchmark]: Boogie Preprocessor took 33.51ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 129.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:51:00,058 INFO L158 Benchmark]: RCFGBuilder took 283.49ms. Allocated memory is still 176.2MB. Free memory was 129.9MB in the beginning and 117.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 19:51:00,059 INFO L158 Benchmark]: TraceAbstraction took 2675.02ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 116.6MB in the beginning and 160.9MB in the end (delta: -44.3MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-09-20 19:51:00,059 INFO L158 Benchmark]: Witness Printer took 48.12ms. Allocated memory is still 239.1MB. Free memory was 160.9MB in the beginning and 158.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:51:00,061 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.17ms. Allocated memory is still 176.2MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.82ms. Allocated memory is still 176.2MB. Free memory was 143.7MB in the beginning and 132.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.47ms. Allocated memory is still 176.2MB. Free memory was 132.4MB in the beginning and 131.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.51ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 129.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 283.49ms. Allocated memory is still 176.2MB. Free memory was 129.9MB in the beginning and 117.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2675.02ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 116.6MB in the beginning and 160.9MB in the end (delta: -44.3MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Witness Printer took 48.12ms. Allocated memory is still 239.1MB. Free memory was 160.9MB in the beginning and 158.8MB 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 - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 746 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 590 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 156 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 16/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id. Ensures: (\result < 5) RESULT: Ultimate proved your program to be correct! [2024-09-20 19:51:00,090 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE