./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound20.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound20.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 83a507b5a78977c4a0b48a152de77bd7eabcfca9b19b757436d28082e86741ee --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 16:12:02,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 16:12:02,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 16:12:02,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 16:12:02,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 16:12:02,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 16:12:02,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 16:12:02,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 16:12:02,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 16:12:02,792 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 16:12:02,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 16:12:02,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 16:12:02,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 16:12:02,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 16:12:02,794 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 16:12:02,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 16:12:02,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 16:12:02,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 16:12:02,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 16:12:02,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 16:12:02,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 16:12:02,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 16:12:02,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 16:12:02,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 16:12:02,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 16:12:02,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 16:12:02,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 16:12:02,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 16:12:02,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 16:12:02,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 16:12:02,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 16:12:02,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 16:12:02,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 16:12:02,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 16:12:02,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 16:12:02,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 16:12:02,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 16:12:02,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 16:12:02,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 16:12:02,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 16:12:02,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 16:12:02,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 16:12:02,802 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 -> 83a507b5a78977c4a0b48a152de77bd7eabcfca9b19b757436d28082e86741ee Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 16:12:03,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 16:12:03,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 16:12:03,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 16:12:03,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 16:12:03,078 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 16:12:03,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound20.c [2024-09-12 16:12:04,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 16:12:04,474 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 16:12:04,475 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound20.c [2024-09-12 16:12:04,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4a0b8eaad/7d3abf8b233f4738a5ac38926cc8b0d3/FLAG888f8fc55 [2024-09-12 16:12:04,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4a0b8eaad/7d3abf8b233f4738a5ac38926cc8b0d3 [2024-09-12 16:12:04,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 16:12:04,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 16:12:04,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 16:12:04,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 16:12:04,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 16:12:04,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 04:12:04" (1/1) ... [2024-09-12 16:12:04,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d18ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:04, skipping insertion in model container [2024-09-12 16:12:04,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 04:12:04" (1/1) ... [2024-09-12 16:12:04,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 16:12:05,028 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound20.c[537,550] [2024-09-12 16:12:05,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 16:12:05,060 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 16:12:05,069 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound20.c[537,550] [2024-09-12 16:12:05,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 16:12:05,094 INFO L204 MainTranslator]: Completed translation [2024-09-12 16:12:05,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05 WrapperNode [2024-09-12 16:12:05,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 16:12:05,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 16:12:05,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 16:12:05,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 16:12:05,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (1/1) ... [2024-09-12 16:12:05,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (1/1) ... [2024-09-12 16:12:05,112 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 16:12:05,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 16:12:05,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 16:12:05,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 16:12:05,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 16:12:05,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (1/1) ... [2024-09-12 16:12:05,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (1/1) ... [2024-09-12 16:12:05,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (1/1) ... [2024-09-12 16:12:05,150 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-12 16:12:05,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (1/1) ... [2024-09-12 16:12:05,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (1/1) ... [2024-09-12 16:12:05,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (1/1) ... [2024-09-12 16:12:05,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (1/1) ... [2024-09-12 16:12:05,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (1/1) ... [2024-09-12 16:12:05,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (1/1) ... [2024-09-12 16:12:05,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 16:12:05,164 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 16:12:05,164 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 16:12:05,164 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 16:12:05,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (1/1) ... [2024-09-12 16:12:05,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 16:12:05,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 16:12:05,192 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-12 16:12:05,194 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-12 16:12:05,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 16:12:05,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 16:12:05,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 16:12:05,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 16:12:05,232 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 16:12:05,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 16:12:05,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 16:12:05,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 16:12:05,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 16:12:05,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 16:12:05,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 16:12:05,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 16:12:05,283 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 16:12:05,285 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 16:12:05,420 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-12 16:12:05,420 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 16:12:05,433 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 16:12:05,433 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 16:12:05,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 04:12:05 BoogieIcfgContainer [2024-09-12 16:12:05,434 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 16:12:05,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 16:12:05,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 16:12:05,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 16:12:05,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 04:12:04" (1/3) ... [2024-09-12 16:12:05,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e49e136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 04:12:05, skipping insertion in model container [2024-09-12 16:12:05,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:12:05" (2/3) ... [2024-09-12 16:12:05,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e49e136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 04:12:05, skipping insertion in model container [2024-09-12 16:12:05,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 04:12:05" (3/3) ... [2024-09-12 16:12:05,439 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound20.c [2024-09-12 16:12:05,451 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 16:12:05,451 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 16:12:05,492 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 16:12:05,499 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;@5571a7a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 16:12:05,499 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 16:12:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 16:12:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 16:12:05,508 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:12:05,508 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:12:05,508 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:12:05,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:05,513 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-12 16:12:05,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 16:12:05,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959671699] [2024-09-12 16:12:05,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:05,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 16:12:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:05,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 16:12:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:05,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 16:12:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:05,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 16:12:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:05,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 16:12:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 16:12:05,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 16:12:05,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959671699] [2024-09-12 16:12:05,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959671699] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 16:12:05,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 16:12:05,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 16:12:05,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078128614] [2024-09-12 16:12:05,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 16:12:05,665 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 16:12:05,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 16:12:05,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 16:12:05,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 16:12:05,682 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 16:12:05,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 16:12:05,705 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-12 16:12:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 16:12:05,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-12 16:12:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 16:12:05,713 INFO L225 Difference]: With dead ends: 66 [2024-09-12 16:12:05,713 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 16:12:05,716 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 16:12:05,718 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 16:12:05,719 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 16:12:05,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 16:12:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 16:12:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 16:12:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-12 16:12:05,753 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-12 16:12:05,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 16:12:05,754 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-12 16:12:05,754 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 16:12:05,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-12 16:12:05,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 16:12:05,756 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:12:05,756 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:12:05,756 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 16:12:05,756 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:12:05,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:05,757 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-12 16:12:05,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 16:12:05,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225061633] [2024-09-12 16:12:05,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:05,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 16:12:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:06,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 16:12:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:06,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 16:12:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:06,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 16:12:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:06,046 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 16:12:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 16:12:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 16:12:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225061633] [2024-09-12 16:12:06,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225061633] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 16:12:06,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 16:12:06,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 16:12:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533961472] [2024-09-12 16:12:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 16:12:06,051 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 16:12:06,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 16:12:06,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 16:12:06,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 16:12:06,052 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-12 16:12:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 16:12:06,110 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-12 16:12:06,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 16:12:06,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-12 16:12:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 16:12:06,111 INFO L225 Difference]: With dead ends: 45 [2024-09-12 16:12:06,111 INFO L226 Difference]: Without dead ends: 43 [2024-09-12 16:12:06,112 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-12 16:12:06,112 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 16:12:06,113 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 16:12:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-12 16:12:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-12 16:12:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 16:12:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-12 16:12:06,127 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-12 16:12:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 16:12:06,128 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-12 16:12:06,128 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-12 16:12:06,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-12 16:12:06,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 16:12:06,130 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:12:06,130 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:12:06,130 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 16:12:06,130 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:12:06,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:06,131 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-12 16:12:06,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 16:12:06,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343817830] [2024-09-12 16:12:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:06,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 16:12:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:06,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 16:12:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:06,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 16:12:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:06,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 16:12:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:06,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 16:12:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:06,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 16:12:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 16:12:06,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 16:12:06,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343817830] [2024-09-12 16:12:06,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343817830] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 16:12:06,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 16:12:06,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 16:12:06,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905319305] [2024-09-12 16:12:06,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 16:12:06,447 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 16:12:06,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 16:12:06,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 16:12:06,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 16:12:06,451 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 16:12:06,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 16:12:06,545 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-12 16:12:06,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 16:12:06,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-12 16:12:06,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 16:12:06,550 INFO L225 Difference]: With dead ends: 49 [2024-09-12 16:12:06,550 INFO L226 Difference]: Without dead ends: 47 [2024-09-12 16:12:06,551 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-12 16:12:06,551 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 16:12:06,552 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 16:12:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-12 16:12:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-12 16:12:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 16:12:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-12 16:12:06,559 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-12 16:12:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 16:12:06,559 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-12 16:12:06,559 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 16:12:06,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:06,560 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-12 16:12:06,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-12 16:12:06,562 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:12:06,562 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:12:06,563 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 16:12:06,563 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:12:06,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:06,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-12 16:12:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 16:12:06,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851109645] [2024-09-12 16:12:06,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 16:12:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 16:12:06,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470654820] [2024-09-12 16:12:06,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:06,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 16:12:06,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 16:12:06,589 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-12 16:12:06,591 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-12 16:12:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:06,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 16:12:06,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 16:12:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-12 16:12:06,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 16:12:06,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 16:12:06,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851109645] [2024-09-12 16:12:06,811 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 16:12:06,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470654820] [2024-09-12 16:12:06,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470654820] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 16:12:06,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 16:12:06,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 16:12:06,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725808486] [2024-09-12 16:12:06,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 16:12:06,814 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 16:12:06,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 16:12:06,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 16:12:06,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-12 16:12:06,815 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 16:12:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 16:12:07,005 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-12 16:12:07,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 16:12:07,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-09-12 16:12:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 16:12:07,008 INFO L225 Difference]: With dead ends: 66 [2024-09-12 16:12:07,009 INFO L226 Difference]: Without dead ends: 53 [2024-09-12 16:12:07,010 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-09-12 16:12:07,010 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 16:12:07,010 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 183 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 16:12:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-12 16:12:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-12 16:12:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-12 16:12:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-12 16:12:07,029 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-12 16:12:07,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 16:12:07,029 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-12 16:12:07,029 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 16:12:07,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-12 16:12:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 16:12:07,030 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:12:07,030 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:12:07,043 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 16:12:07,234 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 16:12:07,235 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:12:07,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:07,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-12 16:12:07,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 16:12:07,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975254293] [2024-09-12 16:12:07,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:07,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 16:12:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 16:12:07,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457473215] [2024-09-12 16:12:07,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:07,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 16:12:07,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 16:12:07,257 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-12 16:12:07,259 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-12 16:12:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:07,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-12 16:12:07,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 16:12:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 16:12:07,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 16:12:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-12 16:12:08,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 16:12:08,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975254293] [2024-09-12 16:12:08,230 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 16:12:08,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457473215] [2024-09-12 16:12:08,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457473215] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 16:12:08,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 16:12:08,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-09-12 16:12:08,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847422056] [2024-09-12 16:12:08,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 16:12:08,232 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 16:12:08,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 16:12:08,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 16:12:08,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-12 16:12:08,234 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-12 16:12:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 16:12:08,637 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-09-12 16:12:08,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 16:12:08,638 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 44 [2024-09-12 16:12:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 16:12:08,640 INFO L225 Difference]: With dead ends: 71 [2024-09-12 16:12:08,641 INFO L226 Difference]: Without dead ends: 63 [2024-09-12 16:12:08,642 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-09-12 16:12:08,643 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 16:12:08,643 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 188 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 16:12:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-12 16:12:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-12 16:12:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-12 16:12:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-09-12 16:12:08,665 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2024-09-12 16:12:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 16:12:08,665 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-09-12 16:12:08,665 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-12 16:12:08,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-09-12 16:12:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 16:12:08,666 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:12:08,667 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:12:08,679 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 16:12:08,867 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 16:12:08,867 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:12:08,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-12 16:12:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 16:12:08,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477844263] [2024-09-12 16:12:08,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:08,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 16:12:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 16:12:08,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1193078008] [2024-09-12 16:12:08,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:08,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 16:12:08,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 16:12:08,907 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-12 16:12:08,908 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-12 16:12:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:08,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 16:12:08,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 16:12:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-12 16:12:09,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 16:12:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-12 16:12:09,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 16:12:09,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477844263] [2024-09-12 16:12:09,174 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 16:12:09,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193078008] [2024-09-12 16:12:09,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193078008] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 16:12:09,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 16:12:09,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-09-12 16:12:09,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555893538] [2024-09-12 16:12:09,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 16:12:09,174 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 16:12:09,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 16:12:09,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 16:12:09,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-12 16:12:09,175 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-12 16:12:13,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 16:12:17,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 16:12:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 16:12:17,634 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-09-12 16:12:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 16:12:17,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2024-09-12 16:12:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 16:12:17,635 INFO L225 Difference]: With dead ends: 73 [2024-09-12 16:12:17,635 INFO L226 Difference]: Without dead ends: 71 [2024-09-12 16:12:17,636 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-12 16:12:17,636 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-09-12 16:12:17,636 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 125 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2024-09-12 16:12:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-12 16:12:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-12 16:12:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-12 16:12:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-09-12 16:12:17,662 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 54 [2024-09-12 16:12:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 16:12:17,662 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-09-12 16:12:17,662 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-12 16:12:17,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-09-12 16:12:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-09-12 16:12:17,665 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:12:17,665 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:12:17,671 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 16:12:17,866 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 16:12:17,866 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:12:17,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:17,867 INFO L85 PathProgramCache]: Analyzing trace with hash -752924724, now seen corresponding path program 1 times [2024-09-12 16:12:17,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 16:12:17,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876697889] [2024-09-12 16:12:17,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:17,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 16:12:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:17,972 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 16:12:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:17,974 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 16:12:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:17,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 16:12:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:17,978 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 16:12:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:17,980 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 16:12:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:17,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-12 16:12:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:17,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-12 16:12:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:17,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 16:12:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:17,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 16:12:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:17,999 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 16:12:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:18,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-12 16:12:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:18,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-12 16:12:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-12 16:12:18,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 16:12:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876697889] [2024-09-12 16:12:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876697889] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 16:12:18,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480965940] [2024-09-12 16:12:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:18,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 16:12:18,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 16:12:18,021 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-12 16:12:18,021 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-12 16:12:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:18,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 16:12:18,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 16:12:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-09-12 16:12:18,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 16:12:18,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480965940] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 16:12:18,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 16:12:18,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2024-09-12 16:12:18,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932706150] [2024-09-12 16:12:18,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 16:12:18,196 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 16:12:18,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 16:12:18,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 16:12:18,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-09-12 16:12:18,197 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-12 16:12:18,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 16:12:18,402 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2024-09-12 16:12:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 16:12:18,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 72 [2024-09-12 16:12:18,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 16:12:18,404 INFO L225 Difference]: With dead ends: 102 [2024-09-12 16:12:18,404 INFO L226 Difference]: Without dead ends: 94 [2024-09-12 16:12:18,404 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-09-12 16:12:18,405 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 16:12:18,405 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 232 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 16:12:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-12 16:12:18,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-09-12 16:12:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 58 states have internal predecessors, (61), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-12 16:12:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-09-12 16:12:18,426 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 72 [2024-09-12 16:12:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 16:12:18,426 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-09-12 16:12:18,426 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-12 16:12:18,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-09-12 16:12:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-12 16:12:18,427 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:12:18,427 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:12:18,442 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 16:12:18,633 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 16:12:18,634 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:12:18,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:12:18,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-12 16:12:18,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 16:12:18,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911821648] [2024-09-12 16:12:18,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 16:12:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 16:12:18,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [163567019] [2024-09-12 16:12:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:12:18,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 16:12:18,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 16:12:18,679 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-12 16:12:18,680 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-12 16:12:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:12:18,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-12 16:12:18,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 16:12:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 54 proven. 23 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-12 16:12:19,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 16:13:14,717 WARN L293 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:13:22,989 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~d~0 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse3 (div .cse2 2)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse4 (mod c_main_~p~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (not (= (mod (* c_main_~p~0 c_main_~B~0) 4294967296) .cse2)) (< (mod c_main_~r~0 4294967296) .cse3) (= .cse4 1) (= .cse0 (mod (+ (* 4294967295 .cse3) c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse4 2))) 4294967296))))) is different from true [2024-09-12 16:13:35,069 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:13:51,116 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:14:19,229 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:14:27,251 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:14:43,267 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:15:07,299 WARN L293 SmtUtils]: Spent 24.03s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:15:23,319 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:15:27,330 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~d~0 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse4 (div .cse2 2)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse5 (mod c_main_~p~0 4294967296)) (.cse3 (mod c_main_~r~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (not (= (mod (* c_main_~p~0 c_main_~B~0) 4294967296) .cse2)) (< .cse3 .cse4) (= .cse5 1) (= .cse0 (mod (+ (* 4294967295 .cse4) c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse5 2))) 4294967296)) (< .cse2 (+ 1 .cse3))))) is different from true [2024-09-12 16:15:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 70 trivial. 2 not checked. [2024-09-12 16:15:28,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 16:15:28,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911821648] [2024-09-12 16:15:28,659 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 16:15:28,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163567019] [2024-09-12 16:15:28,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163567019] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 16:15:28,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 16:15:28,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 23 [2024-09-12 16:15:28,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324006672] [2024-09-12 16:15:28,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 16:15:28,660 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-12 16:15:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 16:15:28,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-12 16:15:28,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=345, Unknown=4, NotChecked=78, Total=506 [2024-09-12 16:15:28,661 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 17 states have internal predecessors, (41), 10 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (21), 10 states have call predecessors, (21), 8 states have call successors, (21) [2024-09-12 16:15:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 16:15:28,875 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2024-09-12 16:15:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 16:15:28,877 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 17 states have internal predecessors, (41), 10 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (21), 10 states have call predecessors, (21), 8 states have call successors, (21) Word has length 74 [2024-09-12 16:15:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 16:15:28,877 INFO L225 Difference]: With dead ends: 93 [2024-09-12 16:15:28,877 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 16:15:28,878 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=95, Invalid=415, Unknown=4, NotChecked=86, Total=600 [2024-09-12 16:15:28,878 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 16:15:28,878 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 48 Unchecked, 0.2s Time] [2024-09-12 16:15:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 16:15:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 16:15:28,879 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-12 16:15:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 16:15:28,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2024-09-12 16:15:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 16:15:28,879 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 16:15:28,879 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 17 states have internal predecessors, (41), 10 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (21), 10 states have call predecessors, (21), 8 states have call successors, (21) [2024-09-12 16:15:28,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:15:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 16:15:28,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 16:15:28,882 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 16:15:28,889 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 16:15:29,083 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-12 16:15:29,085 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:15:29,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 16:15:29,434 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 16:15:29,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 04:15:29 BoogieIcfgContainer [2024-09-12 16:15:29,447 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 16:15:29,447 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 16:15:29,447 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 16:15:29,447 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 16:15:29,448 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 04:12:05" (3/4) ... [2024-09-12 16:15:29,449 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 16:15:29,452 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 16:15:29,453 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-12 16:15:29,453 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 16:15:29,453 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 16:15:29,456 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-12 16:15:29,457 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-12 16:15:29,457 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 16:15:29,457 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 16:15:29,520 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 16:15:29,521 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 16:15:29,521 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 16:15:29,521 INFO L158 Benchmark]: Toolchain (without parser) took 204639.55ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 58.7MB in the beginning and 51.7MB in the end (delta: 7.0MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-09-12 16:15:29,521 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 58.7MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 16:15:29,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.95ms. Allocated memory is still 92.3MB. Free memory was 58.4MB in the beginning and 46.6MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 16:15:29,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.23ms. Allocated memory is still 92.3MB. Free memory was 46.6MB in the beginning and 45.7MB in the end (delta: 865.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 16:15:29,522 INFO L158 Benchmark]: Boogie Preprocessor took 49.95ms. Allocated memory is still 92.3MB. Free memory was 45.7MB in the beginning and 70.1MB in the end (delta: -24.4MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2024-09-12 16:15:29,522 INFO L158 Benchmark]: RCFGBuilder took 270.41ms. Allocated memory is still 92.3MB. Free memory was 70.1MB in the beginning and 57.0MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-12 16:15:29,522 INFO L158 Benchmark]: TraceAbstraction took 204011.78ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 56.5MB in the beginning and 56.9MB in the end (delta: -355.6kB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2024-09-12 16:15:29,523 INFO L158 Benchmark]: Witness Printer took 73.53ms. Allocated memory is still 134.2MB. Free memory was 56.9MB in the beginning and 51.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 16:15:29,524 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 58.7MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.95ms. Allocated memory is still 92.3MB. Free memory was 58.4MB in the beginning and 46.6MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.23ms. Allocated memory is still 92.3MB. Free memory was 46.6MB in the beginning and 45.7MB in the end (delta: 865.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.95ms. Allocated memory is still 92.3MB. Free memory was 45.7MB in the beginning and 70.1MB in the end (delta: -24.4MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * RCFGBuilder took 270.41ms. Allocated memory is still 92.3MB. Free memory was 70.1MB in the beginning and 57.0MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 204011.78ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 56.5MB in the beginning and 56.9MB in the end (delta: -355.6kB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * Witness Printer took 73.53ms. Allocated memory is still 134.2MB. Free memory was 56.9MB in the beginning and 51.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 203.6s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 1166 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 48 IncrementalHoareTripleChecker+Unchecked, 910 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 712 IncrementalHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 256 mSDtfsCounter, 712 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 538 GetRequests, 452 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 23.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 192.1s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 599 ConstructedInterpolants, 0 QuantifiedInterpolants, 2365 SizeOfPredicates, 10 NumberOfNonLiveVariables, 646 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 777/834 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((long long) (r % 4294967296) + 1) <= (B % 4294967296)) && ((B % 4294967296) <= 20)) && (A == r)) && (q == 0)) && (B == d)) && (p == 1)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((B % 4294967296) <= 20) && (A == r)) && ((A % 4294967296) <= 20)) && (1 <= (B % 4294967296))) && (q == 0)) && (B == d)) && (p == 1)) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-12 16:15:29,638 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE