./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.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 ee8fbf7ad7c769bb660b4c416c89e8a6070f0c88820552e25f4a5ca5398fd5ca --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-24 23:25:11,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:25:11,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 23:25:11,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:25:11,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:25:12,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:25:12,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:25:12,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:25:12,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:25:12,015 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:25:12,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:25:12,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:25:12,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:25:12,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:25:12,016 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:25:12,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:25:12,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:25:12,017 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:25:12,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 23:25:12,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:25:12,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:25:12,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:25:12,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:25:12,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:25:12,019 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:25:12,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:25:12,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:25:12,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:25:12,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:25:12,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:25:12,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:25:12,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:25:12,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:25:12,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:25:12,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:25:12,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:25:12,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 23:25:12,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 23:25:12,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:25:12,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:25:12,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:25:12,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:25:12,024 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 -> ee8fbf7ad7c769bb660b4c416c89e8a6070f0c88820552e25f4a5ca5398fd5ca Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-24 23:25:12,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:25:12,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:25:12,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:25:12,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:25:12,235 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:25:12,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2024-09-24 23:25:13,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:25:13,699 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:25:13,699 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2024-09-24 23:25:13,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c2a6c8c8f/f5db6f4957534ec7a74f07b33c5e2117/FLAGa94bcb870 [2024-09-24 23:25:14,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c2a6c8c8f/f5db6f4957534ec7a74f07b33c5e2117 [2024-09-24 23:25:14,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:25:14,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:25:14,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:25:14,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:25:14,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:25:14,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3222b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14, skipping insertion in model container [2024-09-24 23:25:14,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:25:14,262 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c[525,538] [2024-09-24 23:25:14,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:25:14,301 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:25:14,309 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound2.c[525,538] [2024-09-24 23:25:14,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:25:14,331 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:25:14,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14 WrapperNode [2024-09-24 23:25:14,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:25:14,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:25:14,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:25:14,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:25:14,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,354 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:25:14,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:25:14,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:25:14,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:25:14,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:25:14,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,374 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-24 23:25:14,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:25:14,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:25:14,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:25:14,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:25:14,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (1/1) ... [2024-09-24 23:25:14,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:25:14,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:14,418 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-24 23:25:14,422 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-24 23:25:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:25:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-24 23:25:14,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-24 23:25:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:25:14,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:25:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 23:25:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:25:14,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:25:14,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:25:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:25:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:25:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:25:14,519 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:25:14,521 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:25:14,725 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-24 23:25:14,725 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:25:14,748 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:25:14,748 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-24 23:25:14,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:25:14 BoogieIcfgContainer [2024-09-24 23:25:14,748 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:25:14,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:25:14,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:25:14,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:25:14,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:25:14" (1/3) ... [2024-09-24 23:25:14,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17642bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:25:14, skipping insertion in model container [2024-09-24 23:25:14,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:14" (2/3) ... [2024-09-24 23:25:14,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17642bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:25:14, skipping insertion in model container [2024-09-24 23:25:14,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:25:14" (3/3) ... [2024-09-24 23:25:14,756 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.c [2024-09-24 23:25:14,771 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:25:14,771 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:25:14,816 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:25:14,821 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;@2e66f5c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:25:14,822 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:25:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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-24 23:25:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-24 23:25:14,831 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:14,831 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:14,831 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:14,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2032653734, now seen corresponding path program 1 times [2024-09-24 23:25:14,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:14,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395227479] [2024-09-24 23:25:14,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:14,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:15,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:25:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:15,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:25:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 23:25:15,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:15,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395227479] [2024-09-24 23:25:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395227479] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:15,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 23:25:15,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088778759] [2024-09-24 23:25:15,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:15,082 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 23:25:15,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:15,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 23:25:15,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 23:25:15,106 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-24 23:25:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:15,270 INFO L93 Difference]: Finished difference Result 67 states and 108 transitions. [2024-09-24 23:25:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 23:25:15,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-24 23:25:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:15,278 INFO L225 Difference]: With dead ends: 67 [2024-09-24 23:25:15,278 INFO L226 Difference]: Without dead ends: 34 [2024-09-24 23:25:15,281 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 23:25:15,283 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:15,284 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:25:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-24 23:25:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-09-24 23:25:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-24 23:25:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2024-09-24 23:25:15,332 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 17 [2024-09-24 23:25:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:15,332 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-09-24 23:25:15,332 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-24 23:25:15,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2024-09-24 23:25:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-24 23:25:15,334 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:15,334 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:15,334 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 23:25:15,334 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:15,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1118840531, now seen corresponding path program 1 times [2024-09-24 23:25:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382806176] [2024-09-24 23:25:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:15,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:15,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:25:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:15,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:25:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 23:25:15,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:15,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382806176] [2024-09-24 23:25:15,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382806176] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:15,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:15,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:25:15,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408944407] [2024-09-24 23:25:15,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:15,526 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:25:15,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:15,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:25:15,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:25:15,527 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-24 23:25:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:15,690 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2024-09-24 23:25:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:25:15,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-09-24 23:25:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:15,691 INFO L225 Difference]: With dead ends: 54 [2024-09-24 23:25:15,692 INFO L226 Difference]: Without dead ends: 35 [2024-09-24 23:25:15,693 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:25:15,694 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:15,694 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 85 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:25:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-24 23:25:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-24 23:25:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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-24 23:25:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2024-09-24 23:25:15,714 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 19 [2024-09-24 23:25:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:15,714 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2024-09-24 23:25:15,714 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-24 23:25:15,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2024-09-24 23:25:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-24 23:25:15,715 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:15,715 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:15,715 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 23:25:15,716 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:15,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash -668930339, now seen corresponding path program 1 times [2024-09-24 23:25:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643121048] [2024-09-24 23:25:15,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:15,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:25:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:15,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:25:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 23:25:15,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:15,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643121048] [2024-09-24 23:25:15,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643121048] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:15,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:15,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-24 23:25:15,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188665441] [2024-09-24 23:25:15,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:15,890 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-24 23:25:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-24 23:25:15,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-24 23:25:15,892 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-24 23:25:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:16,023 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2024-09-24 23:25:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:25:16,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-09-24 23:25:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:16,024 INFO L225 Difference]: With dead ends: 48 [2024-09-24 23:25:16,024 INFO L226 Difference]: Without dead ends: 39 [2024-09-24 23:25:16,025 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-24 23:25:16,026 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:16,026 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 117 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:25:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-24 23:25:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-09-24 23:25:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 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-24 23:25:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-09-24 23:25:16,032 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 20 [2024-09-24 23:25:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:16,032 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-09-24 23:25:16,032 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-24 23:25:16,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-09-24 23:25:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-24 23:25:16,033 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:16,033 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:16,034 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 23:25:16,034 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:16,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:16,034 INFO L85 PathProgramCache]: Analyzing trace with hash -667440789, now seen corresponding path program 1 times [2024-09-24 23:25:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:16,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250420897] [2024-09-24 23:25:16,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:16,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:16,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:25:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:16,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:25:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 23:25:16,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:16,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250420897] [2024-09-24 23:25:16,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250420897] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:16,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:16,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-24 23:25:16,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16370313] [2024-09-24 23:25:16,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:16,308 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-24 23:25:16,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:16,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-24 23:25:16,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-24 23:25:16,309 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-24 23:25:20,400 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-24 23:25:24,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:25:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:25,063 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2024-09-24 23:25:25,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:25:25,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-24 23:25:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:25,065 INFO L225 Difference]: With dead ends: 68 [2024-09-24 23:25:25,065 INFO L226 Difference]: Without dead ends: 49 [2024-09-24 23:25:25,066 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-09-24 23:25:25,066 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:25,067 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 122 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-09-24 23:25:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-24 23:25:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-24 23:25:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 18 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-24 23:25:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2024-09-24 23:25:25,079 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 20 [2024-09-24 23:25:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:25,079 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-09-24 23:25:25,079 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-24 23:25:25,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2024-09-24 23:25:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-24 23:25:25,080 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:25,080 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:25,080 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-24 23:25:25,080 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:25,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1425403934, now seen corresponding path program 1 times [2024-09-24 23:25:25,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:25,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574404436] [2024-09-24 23:25:25,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:25,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:25,165 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:25:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:25,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:25:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 23:25:25,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:25,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574404436] [2024-09-24 23:25:25,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574404436] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:25:25,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294605307] [2024-09-24 23:25:25,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:25,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:25,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:25,177 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-24 23:25:25,178 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-24 23:25:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:25,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-24 23:25:25,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:25:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 23:25:25,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:25:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 23:25:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294605307] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:25:25,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:25:25,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2024-09-24 23:25:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325598815] [2024-09-24 23:25:25,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:25:25,404 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 23:25:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:25,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 23:25:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-24 23:25:25,406 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-24 23:25:27,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:25:31,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:25:35,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:25:39,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:25:43,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:25:47,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:25:51,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:25:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:51,228 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2024-09-24 23:25:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:25:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 22 [2024-09-24 23:25:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:51,234 INFO L225 Difference]: With dead ends: 70 [2024-09-24 23:25:51,234 INFO L226 Difference]: Without dead ends: 51 [2024-09-24 23:25:51,235 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-24 23:25:51,235 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:51,236 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 102 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 25.8s Time] [2024-09-24 23:25:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-24 23:25:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-24 23:25:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 18 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-24 23:25:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-09-24 23:25:51,250 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 22 [2024-09-24 23:25:51,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:51,251 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-09-24 23:25:51,251 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-24 23:25:51,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-09-24 23:25:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-24 23:25:51,252 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:51,252 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:51,267 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-24 23:25:51,453 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:51,453 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:51,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1582461240, now seen corresponding path program 1 times [2024-09-24 23:25:51,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:51,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463402702] [2024-09-24 23:25:51,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:51,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:25:51,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [425055362] [2024-09-24 23:25:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:51,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:51,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:51,480 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-24 23:25:51,481 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-24 23:25:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:51,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-24 23:25:51,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:25:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 23:25:51,625 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:25:51,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:51,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463402702] [2024-09-24 23:25:51,626 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:25:51,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425055362] [2024-09-24 23:25:51,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425055362] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:51,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:51,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:25:51,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380943197] [2024-09-24 23:25:51,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:51,628 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:25:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:51,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:25:51,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:25:51,629 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-24 23:25:55,786 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-24 23:25:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:55,807 INFO L93 Difference]: Finished difference Result 69 states and 96 transitions. [2024-09-24 23:25:55,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:25:55,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-09-24 23:25:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:55,808 INFO L225 Difference]: With dead ends: 69 [2024-09-24 23:25:55,808 INFO L226 Difference]: Without dead ends: 66 [2024-09-24 23:25:55,809 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-24 23:25:55,809 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:55,809 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-09-24 23:25:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-24 23:25:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-24 23:25:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-24 23:25:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2024-09-24 23:25:55,820 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 23 [2024-09-24 23:25:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:55,821 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2024-09-24 23:25:55,821 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-24 23:25:55,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:55,821 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-09-24 23:25:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-24 23:25:55,822 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:55,822 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:55,834 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-24 23:25:56,025 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-24 23:25:56,026 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:56,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1580971690, now seen corresponding path program 1 times [2024-09-24 23:25:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888178981] [2024-09-24 23:25:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:56,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:25:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:56,129 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:25:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 23:25:56,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888178981] [2024-09-24 23:25:56,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888178981] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:25:56,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028791361] [2024-09-24 23:25:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:56,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:56,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:56,136 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-24 23:25:56,138 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-24 23:25:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:56,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-24 23:25:56,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:25:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 23:25:56,236 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:25:56,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028791361] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:56,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:25:56,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2024-09-24 23:25:56,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790111550] [2024-09-24 23:25:56,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:56,237 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 23:25:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:56,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 23:25:56,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-24 23:25:56,240 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-24 23:25:56,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:56,332 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2024-09-24 23:25:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:25:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-09-24 23:25:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:56,333 INFO L225 Difference]: With dead ends: 78 [2024-09-24 23:25:56,333 INFO L226 Difference]: Without dead ends: 46 [2024-09-24 23:25:56,334 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-09-24 23:25:56,335 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:56,335 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 87 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:25:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-24 23:25:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-24 23:25:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-24 23:25:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-09-24 23:25:56,345 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 23 [2024-09-24 23:25:56,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:56,345 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-09-24 23:25:56,345 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-24 23:25:56,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2024-09-24 23:25:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-24 23:25:56,346 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:56,347 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:56,359 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-24 23:25:56,550 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-24 23:25:56,551 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:56,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:56,552 INFO L85 PathProgramCache]: Analyzing trace with hash -508797286, now seen corresponding path program 1 times [2024-09-24 23:25:56,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:56,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694726801] [2024-09-24 23:25:56,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:56,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:25:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403326009] [2024-09-24 23:25:56,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:56,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:56,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:56,561 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-24 23:25:56,562 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-24 23:25:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:56,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-24 23:25:56,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:25:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 23:25:56,704 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:25:56,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:56,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694726801] [2024-09-24 23:25:56,704 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:25:56,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403326009] [2024-09-24 23:25:56,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403326009] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:56,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:56,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 23:25:56,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170845375] [2024-09-24 23:25:56,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:56,705 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 23:25:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:56,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 23:25:56,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:25:56,706 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:25:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:56,796 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2024-09-24 23:25:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:25:56,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-09-24 23:25:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:56,797 INFO L225 Difference]: With dead ends: 56 [2024-09-24 23:25:56,797 INFO L226 Difference]: Without dead ends: 52 [2024-09-24 23:25:56,798 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-24 23:25:56,798 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:56,799 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:25:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-24 23:25:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-09-24 23:25:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-24 23:25:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-09-24 23:25:56,807 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 25 [2024-09-24 23:25:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:56,807 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-09-24 23:25:56,807 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:25:56,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-09-24 23:25:56,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-24 23:25:56,808 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:56,808 INFO L216 NwaCegarLoop]: trace histogram [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-24 23:25:56,823 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-24 23:25:57,012 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:57,013 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:57,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash 511629789, now seen corresponding path program 1 times [2024-09-24 23:25:57,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449894332] [2024-09-24 23:25:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:25:57,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704071281] [2024-09-24 23:25:57,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:57,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:57,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:57,023 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-24 23:25:57,024 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-24 23:25:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:57,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-24 23:25:57,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:25:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 23:25:57,110 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:25:57,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:57,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449894332] [2024-09-24 23:25:57,110 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:25:57,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704071281] [2024-09-24 23:25:57,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704071281] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:57,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:57,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:25:57,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841378391] [2024-09-24 23:25:57,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:57,111 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:25:57,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:57,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:25:57,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:25:57,112 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:26:01,132 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-24 23:26:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:26:01,181 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2024-09-24 23:26:01,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:26:01,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-09-24 23:26:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:26:01,182 INFO L225 Difference]: With dead ends: 52 [2024-09-24 23:26:01,182 INFO L226 Difference]: Without dead ends: 0 [2024-09-24 23:26:01,182 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-24 23:26:01,182 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:26:01,184 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 104 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-09-24 23:26:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-24 23:26:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-24 23:26:01,185 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-24 23:26:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-24 23:26:01,185 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2024-09-24 23:26:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:26:01,185 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-24 23:26:01,185 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:26:01,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:26:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-24 23:26:01,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-24 23:26:01,188 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-24 23:26:01,212 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-24 23:26:01,388 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:26:01,391 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:26:01,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-24 23:26:02,167 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-24 23:26:02,179 WARN L155 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= ~counter~0 0) (= |old(~counter~0)| 0)) Eliminated clause: (= ~counter~0 0) [2024-09-24 23:26:02,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 11:26:02 BoogieIcfgContainer [2024-09-24 23:26:02,180 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-24 23:26:02,181 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-24 23:26:02,181 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-24 23:26:02,181 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-24 23:26:02,181 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:25:14" (3/4) ... [2024-09-24 23:26:02,183 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-24 23:26:02,222 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-24 23:26:02,222 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-24 23:26:02,222 INFO L158 Benchmark]: Toolchain (without parser) took 48114.60ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 112.4MB in the beginning and 158.5MB in the end (delta: -46.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 23:26:02,223 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 23:26:02,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.88ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 99.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-24 23:26:02,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.97ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 99.0MB in the end (delta: 769.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:26:02,223 INFO L158 Benchmark]: Boogie Preprocessor took 28.70ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 96.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:26:02,223 INFO L158 Benchmark]: RCFGBuilder took 364.67ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 80.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-24 23:26:02,224 INFO L158 Benchmark]: TraceAbstraction took 47430.37ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 79.5MB in the beginning and 161.5MB in the end (delta: -82.0MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-09-24 23:26:02,224 INFO L158 Benchmark]: Witness Printer took 41.31ms. Allocated memory is still 203.4MB. Free memory was 161.5MB in the beginning and 158.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:26:02,225 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.88ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 99.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.97ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 99.0MB in the end (delta: 769.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.70ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 96.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 364.67ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 80.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 47430.37ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 79.5MB in the beginning and 161.5MB in the end (delta: -82.0MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Witness Printer took 41.31ms. Allocated memory is still 203.4MB. Free memory was 161.5MB in the beginning and 158.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.6s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 43.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 43.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 940 SdHoareTripleChecker+Invalid, 42.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 632 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 554 IncrementalHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 308 mSDtfsCounter, 554 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 157 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=6, InterpolantAutomatonStates: 55, 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, 9 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 SizeOfPredicates, 8 NumberOfNonLiveVariables, 409 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 14/22 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: 38]: Loop Invariant Derived loop invariant: ((((((((p == 0) && (n == r)) && (n <= 0)) && (counter == 1)) && (h == 0)) && (q == 1)) || ((((2 <= counter) && (p == 0)) && (n == r)) && (h == 0))) && (\old(counter) == 0)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((\old(counter) == 0) && ((((((p == 0) && (n == r)) && (counter == 1)) && (h == 0)) || (((((p == 0) && (n == r)) && (counter == 0)) && (h == 0)) && (q == 1))) || ((((2 <= counter) && (p == 0)) && (n == r)) && (h == 0)))) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (counter == 0) - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-09-24 23:26:02,280 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE