./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann04.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/Ackermann04.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 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:23:09,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:23:09,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:23:09,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:23:09,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:23:09,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:23:09,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:23:09,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:23:09,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:23:09,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:23:09,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:23:09,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:23:09,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:23:09,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:23:09,393 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:23:09,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:23:09,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:23:09,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:23:09,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:23:09,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:23:09,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:23:09,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:23:09,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:23:09,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:23:09,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:23:09,399 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:23:09,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:23:09,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:23:09,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:23:09,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:23:09,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:23:09,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:23:09,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:23:09,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:23:09,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:23:09,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:23:09,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:23:09,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:23:09,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:23:09,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:23:09,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:23:09,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:23:09,403 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 -> 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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-25 11:23:09,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:23:09,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:23:09,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:23:09,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:23:09,683 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:23:09,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Ackermann04.c [2024-09-25 11:23:11,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:23:11,332 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:23:11,333 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Ackermann04.c [2024-09-25 11:23:11,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8c4f63f99/5e70bbecb7a440c682ee953810f4f38c/FLAG26ad41b01 [2024-09-25 11:23:11,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8c4f63f99/5e70bbecb7a440c682ee953810f4f38c [2024-09-25 11:23:11,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:23:11,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:23:11,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:23:11,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:23:11,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:23:11,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f24ece4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11, skipping insertion in model container [2024-09-25 11:23:11,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:23:11,488 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/Ackermann04.c[1166,1179] [2024-09-25 11:23:11,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:23:11,501 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:23:11,513 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/Ackermann04.c[1166,1179] [2024-09-25 11:23:11,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:23:11,531 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:23:11,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11 WrapperNode [2024-09-25 11:23:11,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:23:11,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:23:11,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:23:11,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:23:11,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,551 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:23:11,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:23:11,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:23:11,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:23:11,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:23:11,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,572 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-25 11:23:11,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:23:11,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:23:11,583 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:23:11,583 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:23:11,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (1/1) ... [2024-09-25 11:23:11,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:23:11,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:11,617 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-25 11:23:11,623 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-25 11:23:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:23:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:23:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:23:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:23:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:23:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2024-09-25 11:23:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2024-09-25 11:23:11,658 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:23:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:23:11,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:23:11,710 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:23:11,711 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:23:11,854 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-09-25 11:23:11,855 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:23:11,871 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:23:11,872 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:23:11,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:23:11 BoogieIcfgContainer [2024-09-25 11:23:11,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:23:11,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:23:11,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:23:11,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:23:11,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:23:11" (1/3) ... [2024-09-25 11:23:11,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9d3521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:23:11, skipping insertion in model container [2024-09-25 11:23:11,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:11" (2/3) ... [2024-09-25 11:23:11,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9d3521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:23:11, skipping insertion in model container [2024-09-25 11:23:11,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:23:11" (3/3) ... [2024-09-25 11:23:11,880 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2024-09-25 11:23:11,892 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:23:11,892 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:23:11,936 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:23:11,941 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;@13dabff4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:23:11,942 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:23:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 11:23:11,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 11:23:11,949 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:11,950 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:23:11,950 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:11,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:11,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2113269736, now seen corresponding path program 1 times [2024-09-25 11:23:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:11,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457444958] [2024-09-25 11:23:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:11,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:12,144 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:12,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:12,196 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-25 11:23:12,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:12,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457444958] [2024-09-25 11:23:12,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457444958] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:23:12,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:23:12,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:23:12,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260025222] [2024-09-25 11:23:12,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:23:12,203 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:23:12,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:12,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:23:12,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:23:12,223 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-25 11:23:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:12,366 INFO L93 Difference]: Finished difference Result 55 states and 81 transitions. [2024-09-25 11:23:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:23:12,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 15 [2024-09-25 11:23:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:12,377 INFO L225 Difference]: With dead ends: 55 [2024-09-25 11:23:12,377 INFO L226 Difference]: Without dead ends: 30 [2024-09-25 11:23:12,380 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:23:12,382 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:12,383 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 84 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:23:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-25 11:23:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-09-25 11:23:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 11:23:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-09-25 11:23:12,444 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2024-09-25 11:23:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:12,446 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-09-25 11:23:12,446 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-25 11:23:12,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-09-25 11:23:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 11:23:12,450 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:12,450 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] [2024-09-25 11:23:12,450 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:23:12,451 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:12,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2051125499, now seen corresponding path program 1 times [2024-09-25 11:23:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:12,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539601762] [2024-09-25 11:23:12,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:12,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:12,552 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:12,564 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:12,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:23:12,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:12,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539601762] [2024-09-25 11:23:12,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539601762] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:23:12,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398185972] [2024-09-25 11:23:12,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:12,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:12,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:12,647 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-25 11:23:12,651 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-25 11:23:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:12,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 11:23:12,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:23:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:23:12,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:23:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:23:12,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398185972] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:23:12,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:23:12,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-09-25 11:23:12,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270108928] [2024-09-25 11:23:12,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:23:12,849 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 11:23:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:12,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 11:23:12,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-09-25 11:23:12,850 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-25 11:23:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:13,013 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2024-09-25 11:23:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 11:23:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 22 [2024-09-25 11:23:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:13,016 INFO L225 Difference]: With dead ends: 83 [2024-09-25 11:23:13,016 INFO L226 Difference]: Without dead ends: 59 [2024-09-25 11:23:13,017 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-09-25 11:23:13,018 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 26 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:13,018 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 119 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:23:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-25 11:23:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2024-09-25 11:23:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 12 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (28), 13 states have call predecessors, (28), 11 states have call successors, (28) [2024-09-25 11:23:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2024-09-25 11:23:13,037 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 22 [2024-09-25 11:23:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:13,037 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2024-09-25 11:23:13,038 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-25 11:23:13,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2024-09-25 11:23:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-25 11:23:13,040 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:13,040 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:23:13,058 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 11:23:13,241 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:13,241 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:13,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1636113567, now seen corresponding path program 1 times [2024-09-25 11:23:13,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:13,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860667709] [2024-09-25 11:23:13,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:13,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:13,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:13,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:13,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:13,552 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:13,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:13,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:13,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:23:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-25 11:23:13,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:13,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860667709] [2024-09-25 11:23:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860667709] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:23:13,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780610975] [2024-09-25 11:23:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:13,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:13,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:13,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:23:13,624 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 11:23:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:13,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 11:23:13,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:23:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-09-25 11:23:13,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:23:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-25 11:23:14,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780610975] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:23:14,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:23:14,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-09-25 11:23:14,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309231249] [2024-09-25 11:23:14,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:23:14,107 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 11:23:14,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:14,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 11:23:14,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:23:14,108 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-25 11:23:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:14,186 INFO L93 Difference]: Finished difference Result 123 states and 230 transitions. [2024-09-25 11:23:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:23:14,186 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) Word has length 48 [2024-09-25 11:23:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:14,188 INFO L225 Difference]: With dead ends: 123 [2024-09-25 11:23:14,188 INFO L226 Difference]: Without dead ends: 56 [2024-09-25 11:23:14,190 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-09-25 11:23:14,190 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:14,191 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:23:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-25 11:23:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-09-25 11:23:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 10 states have call successors, (10), 6 states have call predecessors, (10), 9 states have return successors, (29), 12 states have call predecessors, (29), 9 states have call successors, (29) [2024-09-25 11:23:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-09-25 11:23:14,201 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 48 [2024-09-25 11:23:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:14,201 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-09-25 11:23:14,201 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-25 11:23:14,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-09-25 11:23:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-25 11:23:14,203 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:14,204 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:23:14,219 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 11:23:14,404 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:14,404 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:14,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash 732471144, now seen corresponding path program 2 times [2024-09-25 11:23:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:14,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642485647] [2024-09-25 11:23:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:14,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,478 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 11:23:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,908 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,911 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-25 11:23:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,925 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-09-25 11:23:14,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:14,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642485647] [2024-09-25 11:23:14,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642485647] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:23:14,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781675244] [2024-09-25 11:23:14,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:23:14,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:14,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:14,930 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:23:14,931 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 11:23:14,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:23:14,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:23:14,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-25 11:23:14,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:23:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 141 proven. 37 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-09-25 11:23:15,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:23:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-09-25 11:23:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781675244] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:23:16,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:23:16,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 29 [2024-09-25 11:23:16,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902622383] [2024-09-25 11:23:16,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:23:16,214 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-25 11:23:16,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:16,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-25 11:23:16,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-09-25 11:23:16,215 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (15), 2 states have call predecessors, (15), 12 states have return successors, (25), 15 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-25 11:23:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:16,552 INFO L93 Difference]: Finished difference Result 122 states and 225 transitions. [2024-09-25 11:23:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-25 11:23:16,553 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (15), 2 states have call predecessors, (15), 12 states have return successors, (25), 15 states have call predecessors, (25), 9 states have call successors, (25) Word has length 82 [2024-09-25 11:23:16,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:16,555 INFO L225 Difference]: With dead ends: 122 [2024-09-25 11:23:16,556 INFO L226 Difference]: Without dead ends: 74 [2024-09-25 11:23:16,557 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=381, Invalid=1599, Unknown=0, NotChecked=0, Total=1980 [2024-09-25 11:23:16,557 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:16,558 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 192 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:23:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-09-25 11:23:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2024-09-25 11:23:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 10 states have call successors, (10), 6 states have call predecessors, (10), 9 states have return successors, (25), 12 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-25 11:23:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2024-09-25 11:23:16,571 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 82 [2024-09-25 11:23:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:16,571 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2024-09-25 11:23:16,571 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (15), 2 states have call predecessors, (15), 12 states have return successors, (25), 15 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-25 11:23:16,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2024-09-25 11:23:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-09-25 11:23:16,574 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:16,575 INFO L216 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:23:16,587 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 11:23:16,778 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:16,779 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:16,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1096714260, now seen corresponding path program 3 times [2024-09-25 11:23:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:16,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759624605] [2024-09-25 11:23:16,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:16,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:16,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:16,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,035 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,144 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,162 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 11:23:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,250 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,252 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-09-25 11:23:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,278 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 163 proven. 157 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-09-25 11:23:17,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:17,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759624605] [2024-09-25 11:23:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759624605] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:23:17,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884271965] [2024-09-25 11:23:17,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 11:23:17,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:17,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:17,283 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:23:17,284 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 11:23:17,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-09-25 11:23:17,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:23:17,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-25 11:23:17,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:23:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 190 proven. 71 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2024-09-25 11:23:17,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:23:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 208 proven. 61 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-09-25 11:23:18,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884271965] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:23:18,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:23:18,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 15] total 28 [2024-09-25 11:23:18,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113495515] [2024-09-25 11:23:18,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:23:18,538 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-25 11:23:18,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:18,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-25 11:23:18,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2024-09-25 11:23:18,539 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 23 states have internal predecessors, (64), 11 states have call successors, (16), 1 states have call predecessors, (16), 12 states have return successors, (26), 14 states have call predecessors, (26), 11 states have call successors, (26) [2024-09-25 11:23:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:18,971 INFO L93 Difference]: Finished difference Result 122 states and 209 transitions. [2024-09-25 11:23:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-25 11:23:18,972 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 23 states have internal predecessors, (64), 11 states have call successors, (16), 1 states have call predecessors, (16), 12 states have return successors, (26), 14 states have call predecessors, (26), 11 states have call successors, (26) Word has length 108 [2024-09-25 11:23:18,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:18,974 INFO L225 Difference]: With dead ends: 122 [2024-09-25 11:23:18,974 INFO L226 Difference]: Without dead ends: 67 [2024-09-25 11:23:18,976 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 235 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=492, Invalid=1958, Unknown=0, NotChecked=0, Total=2450 [2024-09-25 11:23:18,977 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:18,977 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 239 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:23:18,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-25 11:23:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-09-25 11:23:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 40 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (25), 12 states have call predecessors, (25), 10 states have call successors, (25) [2024-09-25 11:23:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2024-09-25 11:23:19,000 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 108 [2024-09-25 11:23:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:19,000 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2024-09-25 11:23:19,000 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 23 states have internal predecessors, (64), 11 states have call successors, (16), 1 states have call predecessors, (16), 12 states have return successors, (26), 14 states have call predecessors, (26), 11 states have call successors, (26) [2024-09-25 11:23:19,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2024-09-25 11:23:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-09-25 11:23:19,004 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:19,004 INFO L216 NwaCegarLoop]: trace histogram [33, 33, 20, 13, 12, 12, 12, 12, 12, 12, 12, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:23:19,033 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 11:23:19,204 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:19,205 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:19,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1260803800, now seen corresponding path program 4 times [2024-09-25 11:23:19,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:19,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114263556] [2024-09-25 11:23:19,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,419 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,556 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,621 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 11:23:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,775 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 11:23:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-25 11:23:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-09-25 11:23:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,925 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,939 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,940 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,945 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 11:23:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,976 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 11:23:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,986 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-25 11:23:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-09-25 11:23:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 219 proven. 706 refuted. 0 times theorem prover too weak. 1697 trivial. 0 not checked. [2024-09-25 11:23:19,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:19,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114263556] [2024-09-25 11:23:19,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114263556] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:23:19,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731692385] [2024-09-25 11:23:19,990 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 11:23:19,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:19,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:19,991 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:23:19,993 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 11:23:20,094 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 11:23:20,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:23:20,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-25 11:23:20,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:23:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 1455 proven. 210 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2024-09-25 11:23:20,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:23:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 223 proven. 1020 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2024-09-25 11:23:22,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731692385] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:23:22,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:23:22,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 15] total 32 [2024-09-25 11:23:22,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916114802] [2024-09-25 11:23:22,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:23:22,455 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-25 11:23:22,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-25 11:23:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-09-25 11:23:22,456 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 32 states, 32 states have (on average 3.03125) internal successors, (97), 29 states have internal predecessors, (97), 18 states have call successors, (31), 2 states have call predecessors, (31), 15 states have return successors, (40), 15 states have call predecessors, (40), 18 states have call successors, (40) [2024-09-25 11:23:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:24,177 INFO L93 Difference]: Finished difference Result 181 states and 367 transitions. [2024-09-25 11:23:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-09-25 11:23:24,178 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.03125) internal successors, (97), 29 states have internal predecessors, (97), 18 states have call successors, (31), 2 states have call predecessors, (31), 15 states have return successors, (40), 15 states have call predecessors, (40), 18 states have call successors, (40) Word has length 227 [2024-09-25 11:23:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:24,181 INFO L225 Difference]: With dead ends: 181 [2024-09-25 11:23:24,181 INFO L226 Difference]: Without dead ends: 120 [2024-09-25 11:23:24,184 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 497 SyntacticMatches, 11 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1851, Invalid=8451, Unknown=0, NotChecked=0, Total=10302 [2024-09-25 11:23:24,184 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 285 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:24,185 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 275 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 11:23:24,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-09-25 11:23:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2024-09-25 11:23:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 20 states have call successors, (20), 11 states have call predecessors, (20), 15 states have return successors, (60), 23 states have call predecessors, (60), 19 states have call successors, (60) [2024-09-25 11:23:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2024-09-25 11:23:24,208 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 227 [2024-09-25 11:23:24,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:24,208 INFO L474 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2024-09-25 11:23:24,208 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.03125) internal successors, (97), 29 states have internal predecessors, (97), 18 states have call successors, (31), 2 states have call predecessors, (31), 15 states have return successors, (40), 15 states have call predecessors, (40), 18 states have call successors, (40) [2024-09-25 11:23:24,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2024-09-25 11:23:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-09-25 11:23:24,210 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:24,210 INFO L216 NwaCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:23:24,223 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 11:23:24,411 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 11:23:24,411 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:24,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1720213164, now seen corresponding path program 5 times [2024-09-25 11:23:24,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:24,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105716344] [2024-09-25 11:23:24,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:24,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,739 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 11:23:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,149 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,173 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:23:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,180 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 11:23:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,186 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-09-25 11:23:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,246 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,271 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,301 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,304 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:23:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 11:23:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 445 proven. 284 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2024-09-25 11:23:25,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105716344] [2024-09-25 11:23:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105716344] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:23:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307357307] [2024-09-25 11:23:25,308 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 11:23:25,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:25,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:25,312 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:23:25,315 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 11:23:25,444 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-09-25 11:23:25,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:23:25,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-25 11:23:25,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:23:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2024-09-25 11:23:25,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:23:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-09-25 11:23:28,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307357307] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:23:28,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:23:28,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 27] total 38 [2024-09-25 11:23:28,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423994640] [2024-09-25 11:23:28,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:23:28,864 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-25 11:23:28,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:28,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-25 11:23:28,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2024-09-25 11:23:28,866 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 38 states, 38 states have (on average 2.210526315789474) internal successors, (84), 32 states have internal predecessors, (84), 16 states have call successors, (21), 1 states have call predecessors, (21), 18 states have return successors, (37), 18 states have call predecessors, (37), 16 states have call successors, (37) [2024-09-25 11:23:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:29,491 INFO L93 Difference]: Finished difference Result 227 states and 402 transitions. [2024-09-25 11:23:29,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-25 11:23:29,492 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.210526315789474) internal successors, (84), 32 states have internal predecessors, (84), 16 states have call successors, (21), 1 states have call predecessors, (21), 18 states have return successors, (37), 18 states have call predecessors, (37), 16 states have call successors, (37) Word has length 160 [2024-09-25 11:23:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:29,495 INFO L225 Difference]: With dead ends: 227 [2024-09-25 11:23:29,495 INFO L226 Difference]: Without dead ends: 136 [2024-09-25 11:23:29,499 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 342 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=874, Invalid=3818, Unknown=0, NotChecked=0, Total=4692 [2024-09-25 11:23:29,500 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 114 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:29,500 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 326 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 11:23:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-09-25 11:23:29,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2024-09-25 11:23:29,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.105263157894737) internal successors, (84), 77 states have internal predecessors, (84), 23 states have call successors, (23), 11 states have call predecessors, (23), 18 states have return successors, (81), 29 states have call predecessors, (81), 22 states have call successors, (81) [2024-09-25 11:23:29,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 188 transitions. [2024-09-25 11:23:29,520 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 188 transitions. Word has length 160 [2024-09-25 11:23:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:29,521 INFO L474 AbstractCegarLoop]: Abstraction has 118 states and 188 transitions. [2024-09-25 11:23:29,521 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.210526315789474) internal successors, (84), 32 states have internal predecessors, (84), 16 states have call successors, (21), 1 states have call predecessors, (21), 18 states have return successors, (37), 18 states have call predecessors, (37), 16 states have call successors, (37) [2024-09-25 11:23:29,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 188 transitions. [2024-09-25 11:23:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-09-25 11:23:29,526 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:29,526 INFO L216 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:23:29,538 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-25 11:23:29,729 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:29,730 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:29,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1288512238, now seen corresponding path program 6 times [2024-09-25 11:23:29,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:29,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382098872] [2024-09-25 11:23:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:29,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:29,966 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:29,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,180 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,182 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,184 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 11:23:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,196 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,202 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:23:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,208 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 11:23:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-09-25 11:23:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,499 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:23:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,600 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 11:23:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-25 11:23:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,611 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-25 11:23:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 686 proven. 70 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2024-09-25 11:23:30,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:30,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382098872] [2024-09-25 11:23:30,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382098872] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:23:30,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802402801] [2024-09-25 11:23:30,618 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 11:23:30,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:30,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:30,619 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:23:30,620 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 11:23:30,781 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2024-09-25 11:23:30,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:23:30,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-25 11:23:30,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:23:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2024-09-25 11:23:30,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:23:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 711 proven. 75 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-09-25 11:23:36,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802402801] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:23:36,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:23:36,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 38 [2024-09-25 11:23:36,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916669221] [2024-09-25 11:23:36,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:23:36,579 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-25 11:23:36,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:36,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-25 11:23:36,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2024-09-25 11:23:36,580 INFO L87 Difference]: Start difference. First operand 118 states and 188 transitions. Second operand has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 31 states have internal predecessors, (59), 6 states have call successors, (11), 1 states have call predecessors, (11), 15 states have return successors, (24), 13 states have call predecessors, (24), 6 states have call successors, (24) [2024-09-25 11:23:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:37,819 INFO L93 Difference]: Finished difference Result 195 states and 346 transitions. [2024-09-25 11:23:37,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-09-25 11:23:37,820 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 31 states have internal predecessors, (59), 6 states have call successors, (11), 1 states have call predecessors, (11), 15 states have return successors, (24), 13 states have call predecessors, (24), 6 states have call successors, (24) Word has length 186 [2024-09-25 11:23:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:37,822 INFO L225 Difference]: With dead ends: 195 [2024-09-25 11:23:37,822 INFO L226 Difference]: Without dead ends: 191 [2024-09-25 11:23:37,824 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 400 SyntacticMatches, 20 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1027, Invalid=4673, Unknown=0, NotChecked=0, Total=5700 [2024-09-25 11:23:37,825 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 69 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:37,825 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 342 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 11:23:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-09-25 11:23:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 141. [2024-09-25 11:23:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 91 states have (on average 1.0879120879120878) internal successors, (99), 92 states have internal predecessors, (99), 24 states have call successors, (24), 11 states have call predecessors, (24), 25 states have return successors, (122), 37 states have call predecessors, (122), 23 states have call successors, (122) [2024-09-25 11:23:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 245 transitions. [2024-09-25 11:23:37,851 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 245 transitions. Word has length 186 [2024-09-25 11:23:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:37,851 INFO L474 AbstractCegarLoop]: Abstraction has 141 states and 245 transitions. [2024-09-25 11:23:37,852 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 31 states have internal predecessors, (59), 6 states have call successors, (11), 1 states have call predecessors, (11), 15 states have return successors, (24), 13 states have call predecessors, (24), 6 states have call successors, (24) [2024-09-25 11:23:37,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 245 transitions. [2024-09-25 11:23:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-09-25 11:23:37,853 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:37,853 INFO L216 NwaCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:23:37,869 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 11:23:38,054 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:38,054 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:38,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1618887262, now seen corresponding path program 7 times [2024-09-25 11:23:38,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:38,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894667384] [2024-09-25 11:23:38,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:38,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,253 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 11:23:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,503 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,588 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:23:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,675 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 11:23:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-09-25 11:23:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:23:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:23:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 11:23:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-25 11:23:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 502 proven. 372 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2024-09-25 11:23:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:38,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894667384] [2024-09-25 11:23:38,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894667384] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:23:38,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637605395] [2024-09-25 11:23:38,843 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 11:23:38,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:38,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:38,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:23:38,845 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 11:23:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:39,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-25 11:23:39,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:23:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-09-25 11:23:39,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:23:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-09-25 11:23:43,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637605395] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:23:43,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:23:43,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 28] total 35 [2024-09-25 11:23:43,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406320913] [2024-09-25 11:23:43,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:23:43,250 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-25 11:23:43,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:43,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-25 11:23:43,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 11:23:43,251 INFO L87 Difference]: Start difference. First operand 141 states and 245 transitions. Second operand has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 31 states have internal predecessors, (85), 17 states have call successors, (22), 1 states have call predecessors, (22), 18 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) [2024-09-25 11:23:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:44,008 INFO L93 Difference]: Finished difference Result 285 states and 576 transitions. [2024-09-25 11:23:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-09-25 11:23:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 31 states have internal predecessors, (85), 17 states have call successors, (22), 1 states have call predecessors, (22), 18 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) Word has length 173 [2024-09-25 11:23:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:44,010 INFO L225 Difference]: With dead ends: 285 [2024-09-25 11:23:44,010 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:23:44,013 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 371 SyntacticMatches, 19 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=993, Invalid=3977, Unknown=0, NotChecked=0, Total=4970 [2024-09-25 11:23:44,014 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 77 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:44,014 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 240 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 11:23:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:23:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:23:44,018 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-25 11:23:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:23:44,018 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2024-09-25 11:23:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:44,019 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:23:44,019 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4285714285714284) internal successors, (85), 31 states have internal predecessors, (85), 17 states have call successors, (22), 1 states have call predecessors, (22), 18 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) [2024-09-25 11:23:44,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:23:44,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:23:44,021 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:23:44,034 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 11:23:44,225 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:44,228 INFO L408 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2024-09-25 11:23:44,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:23:53,620 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:23:53,647 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:23:53,648 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:23:53,652 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:23:53,652 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:23:53,652 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:23:53,652 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:23:53,653 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-25 11:23:53,653 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:23:53,653 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:23:53,654 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:23:53,655 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:23:53,655 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:23:53,655 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:23:53,655 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:23:53,655 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:23:53,655 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:23:53,655 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:23:53,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:23:53 BoogieIcfgContainer [2024-09-25 11:23:53,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:23:53,656 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:23:53,656 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:23:53,656 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:23:53,657 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:23:11" (3/4) ... [2024-09-25 11:23:53,663 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:23:53,714 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:23:53,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:23:53,714 INFO L158 Benchmark]: Toolchain (without parser) took 42361.28ms. Allocated memory was 86.0MB in the beginning and 1.1GB in the end (delta: 977.3MB). Free memory was 64.2MB in the beginning and 967.0MB in the end (delta: -902.8MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2024-09-25 11:23:53,715 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory is still 39.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:23:53,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.24ms. Allocated memory is still 86.0MB. Free memory was 64.0MB in the beginning and 52.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 11:23:53,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.34ms. Allocated memory is still 86.0MB. Free memory was 52.8MB in the beginning and 51.9MB in the end (delta: 953.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:23:53,715 INFO L158 Benchmark]: Boogie Preprocessor took 30.42ms. Allocated memory is still 86.0MB. Free memory was 51.9MB in the beginning and 50.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:23:53,715 INFO L158 Benchmark]: RCFGBuilder took 290.00ms. Allocated memory is still 86.0MB. Free memory was 50.2MB in the beginning and 59.2MB in the end (delta: -9.0MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-09-25 11:23:53,715 INFO L158 Benchmark]: TraceAbstraction took 41781.05ms. Allocated memory was 86.0MB in the beginning and 1.1GB in the end (delta: 977.3MB). Free memory was 58.6MB in the beginning and 971.2MB in the end (delta: -912.6MB). Peak memory consumption was 650.2MB. Max. memory is 16.1GB. [2024-09-25 11:23:53,716 INFO L158 Benchmark]: Witness Printer took 58.10ms. Allocated memory is still 1.1GB. Free memory was 971.2MB in the beginning and 967.0MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:23:53,717 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 62.9MB. Free memory is still 39.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.24ms. Allocated memory is still 86.0MB. Free memory was 64.0MB in the beginning and 52.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.34ms. Allocated memory is still 86.0MB. Free memory was 52.8MB in the beginning and 51.9MB in the end (delta: 953.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.42ms. Allocated memory is still 86.0MB. Free memory was 51.9MB in the beginning and 50.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 290.00ms. Allocated memory is still 86.0MB. Free memory was 50.2MB in the beginning and 59.2MB in the end (delta: -9.0MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * TraceAbstraction took 41781.05ms. Allocated memory was 86.0MB in the beginning and 1.1GB in the end (delta: 977.3MB). Free memory was 58.6MB in the beginning and 971.2MB in the end (delta: -912.6MB). Peak memory consumption was 650.2MB. Max. memory is 16.1GB. * Witness Printer took 58.10ms. Allocated memory is still 1.1GB. Free memory was 971.2MB in the beginning and 967.0MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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: 45]: 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 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.3s, OverallIterations: 9, TraceHistogramMax: 33, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 682 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 1902 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1652 mSDsCounter, 878 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4472 IncrementalHoareTripleChecker+Invalid, 5350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 878 mSolverCounterUnsat, 250 mSDtfsCounter, 4472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2680 GetRequests, 2178 SyntacticMatches, 75 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7159 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=8, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 118 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 2027 NumberOfCodeBlocks, 1933 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 3008 ConstructedInterpolants, 0 QuantifiedInterpolants, 5872 SizeOfPredicates, 32 NumberOfNonLiveVariables, 2747 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 19128/23808 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: 16]: Procedure Contract for ackermann Derived contract for procedure ackermann. Ensures: (((n < \result) || (m != 0)) && ((0 < m) || (m == 0))) RESULT: Ultimate proved your program to be correct! [2024-09-25 11:23:53,747 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE