./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound50.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_valuebound50.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 7ab48dd793c80bfdca8b2cb012b1dd7cd8eda625223788e3f60486b3a2e166d4 --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:25,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:25:26,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 23:25:26,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:25:26,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:25:26,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:25:26,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:25:26,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:25:26,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:25:26,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:25:26,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:25:26,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:25:26,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:25:26,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:25:26,081 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:25:26,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:25:26,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:25:26,082 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:25:26,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 23:25:26,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:25:26,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:25:26,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:25:26,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:25:26,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:25:26,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:25:26,088 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:25:26,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:25:26,088 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:25:26,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:25:26,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:25:26,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:25:26,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:25:26,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:25:26,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:25:26,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:25:26,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:25:26,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 23:25:26,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 23:25:26,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:25:26,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:25:26,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:25:26,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:25:26,092 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 -> 7ab48dd793c80bfdca8b2cb012b1dd7cd8eda625223788e3f60486b3a2e166d4 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:26,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:25:26,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:25:26,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:25:26,315 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:25:26,315 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:25:26,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound50.c [2024-09-24 23:25:27,549 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:25:27,718 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:25:27,719 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound50.c [2024-09-24 23:25:27,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b1e709e96/8049d26109c8462ba355ce77c7aca649/FLAG2c8f1616b [2024-09-24 23:25:28,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b1e709e96/8049d26109c8462ba355ce77c7aca649 [2024-09-24 23:25:28,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:25:28,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:25:28,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:25:28,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:25:28,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:25:28,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:25:28" (1/1) ... [2024-09-24 23:25:28,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62962348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:28, skipping insertion in model container [2024-09-24 23:25:28,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:25:28" (1/1) ... [2024-09-24 23:25:28,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:25:28,263 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_valuebound50.c[525,538] [2024-09-24 23:25:28,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:25:28,293 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:25:28,302 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_valuebound50.c[525,538] [2024-09-24 23:25:28,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:25:28,327 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:25:28,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:28 WrapperNode [2024-09-24 23:25:28,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:25:28,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:25:28,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:25:28,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:25:28,341 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:28" (1/1) ... [2024-09-24 23:25:28,367 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:28" (1/1) ... [2024-09-24 23:25:28,373 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:25:28,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:25:28,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:25:28,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:25:28,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:25:28,382 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:28" (1/1) ... [2024-09-24 23:25:28,382 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:28" (1/1) ... [2024-09-24 23:25:28,388 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:28" (1/1) ... [2024-09-24 23:25:28,419 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:28,419 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:28" (1/1) ... [2024-09-24 23:25:28,420 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:28" (1/1) ... [2024-09-24 23:25:28,425 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:28" (1/1) ... [2024-09-24 23:25:28,428 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:28" (1/1) ... [2024-09-24 23:25:28,429 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:28" (1/1) ... [2024-09-24 23:25:28,430 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:28" (1/1) ... [2024-09-24 23:25:28,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:25:28,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:25:28,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:25:28,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:25:28,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:28" (1/1) ... [2024-09-24 23:25:28,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:25:28,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:28,463 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:28,465 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:28,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:25:28,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-24 23:25:28,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-24 23:25:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:25:28,496 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:25:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 23:25:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:25:28,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:25:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:25:28,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:25:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:25:28,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:25:28,545 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:25:28,547 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:25:28,693 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-24 23:25:28,693 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:25:28,706 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:25:28,707 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-24 23:25:28,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:25:28 BoogieIcfgContainer [2024-09-24 23:25:28,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:25:28,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:25:28,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:25:28,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:25:28,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:25:28" (1/3) ... [2024-09-24 23:25:28,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3976afa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:25:28, skipping insertion in model container [2024-09-24 23:25:28,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:28" (2/3) ... [2024-09-24 23:25:28,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3976afa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:25:28, skipping insertion in model container [2024-09-24 23:25:28,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:25:28" (3/3) ... [2024-09-24 23:25:28,713 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound50.c [2024-09-24 23:25:28,724 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:25:28,725 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:25:28,762 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:25:28,767 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;@731c4fed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:25:28,767 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:25:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-24 23:25:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-24 23:25:28,775 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:28,776 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:28,776 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:28,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash 570623365, now seen corresponding path program 1 times [2024-09-24 23:25:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:28,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890210274] [2024-09-24 23:25:28,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:28,903 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:25:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:28,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:25:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:28,925 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:25:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:28,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:28,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890210274] [2024-09-24 23:25:28,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890210274] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:28,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:28,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 23:25:28,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602401247] [2024-09-24 23:25:28,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:28,949 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 23:25:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:28,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 23:25:28,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 23:25:28,973 INFO L87 Difference]: Start difference. First operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:25:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:28,996 INFO L93 Difference]: Finished difference Result 66 states and 110 transitions. [2024-09-24 23:25:28,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 23:25:28,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-24 23:25:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:29,004 INFO L225 Difference]: With dead ends: 66 [2024-09-24 23:25:29,004 INFO L226 Difference]: Without dead ends: 32 [2024-09-24 23:25:29,007 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 23:25:29,009 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:29,013 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:25:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-24 23:25:29,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-24 23:25:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-24 23:25:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-09-24 23:25:29,058 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2024-09-24 23:25:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:29,058 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-09-24 23:25:29,059 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:25:29,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-09-24 23:25:29,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-24 23:25:29,062 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:29,062 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] [2024-09-24 23:25:29,062 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 23:25:29,062 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:29,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:29,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2095105318, now seen corresponding path program 1 times [2024-09-24 23:25:29,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:29,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458370353] [2024-09-24 23:25:29,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:29,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:29,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:25:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:29,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:25:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:29,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:25:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:29,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:29,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458370353] [2024-09-24 23:25:29,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458370353] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:29,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:29,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 23:25:29,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713712672] [2024-09-24 23:25:29,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:29,486 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 23:25:29,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:29,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 23:25:29,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:25:29,489 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-24 23:25:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:29,764 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2024-09-24 23:25:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:25:29,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-24 23:25:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:29,767 INFO L225 Difference]: With dead ends: 64 [2024-09-24 23:25:29,767 INFO L226 Difference]: Without dead ends: 46 [2024-09-24 23:25:29,768 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-24 23:25:29,770 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:29,771 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-24 23:25:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-24 23:25:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-24 23:25:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-24 23:25:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-09-24 23:25:29,795 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2024-09-24 23:25:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:29,797 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-09-24 23:25:29,797 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-24 23:25:29,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-09-24 23:25:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-24 23:25:29,800 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:29,800 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:29,800 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 23:25:29,800 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:29,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1429886677, now seen corresponding path program 1 times [2024-09-24 23:25:29,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:29,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028998406] [2024-09-24 23:25:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:29,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:30,062 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:25:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:30,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:25:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:30,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:25:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:30,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:30,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028998406] [2024-09-24 23:25:30,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028998406] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:25:30,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917805164] [2024-09-24 23:25:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:30,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:30,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:30,084 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:30,093 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:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:30,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-24 23:25:30,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:25:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:30,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:25:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:30,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917805164] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:25:30,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:25:30,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-24 23:25:30,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782205316] [2024-09-24 23:25:30,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:25:30,403 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-24 23:25:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-24 23:25:30,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-24 23:25:30,409 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-24 23:25:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:32,112 INFO L93 Difference]: Finished difference Result 115 states and 181 transitions. [2024-09-24 23:25:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 23:25:32,113 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-24 23:25:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:32,134 INFO L225 Difference]: With dead ends: 115 [2024-09-24 23:25:32,134 INFO L226 Difference]: Without dead ends: 97 [2024-09-24 23:25:32,135 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-09-24 23:25:32,136 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:32,136 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 304 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-09-24 23:25:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-24 23:25:32,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2024-09-24 23:25:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-24 23:25:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2024-09-24 23:25:32,154 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 25 [2024-09-24 23:25:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:32,154 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2024-09-24 23:25:32,154 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-24 23:25:32,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-09-24 23:25:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-24 23:25:32,156 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:32,156 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:32,168 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:32,359 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:32,360 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:32,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:32,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1189191834, now seen corresponding path program 1 times [2024-09-24 23:25:32,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:32,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426974690] [2024-09-24 23:25:32,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:32,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:25:32,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763870022] [2024-09-24 23:25:32,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:32,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:32,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:32,396 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:32,399 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:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:32,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-24 23:25:32,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:25:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-24 23:25:32,488 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:25:32,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:32,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426974690] [2024-09-24 23:25:32,489 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:25:32,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763870022] [2024-09-24 23:25:32,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763870022] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:32,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:32,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:25:32,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188160787] [2024-09-24 23:25:32,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:32,492 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:25:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:25:32,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:25:32,494 INFO L87 Difference]: Start difference. First operand 65 states and 91 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-24 23:25:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:32,628 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-09-24 23:25:32,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:25:32,629 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-24 23:25:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:32,631 INFO L225 Difference]: With dead ends: 90 [2024-09-24 23:25:32,633 INFO L226 Difference]: Without dead ends: 87 [2024-09-24 23:25:32,634 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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:32,634 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:32,635 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:25:32,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-24 23:25:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-09-24 23:25:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-09-24 23:25:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-09-24 23:25:32,666 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 33 [2024-09-24 23:25:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:32,666 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-09-24 23:25:32,666 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-24 23:25:32,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-09-24 23:25:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-24 23:25:32,667 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:32,668 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 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:32,680 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-24 23:25:32,871 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:32,872 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:32,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:32,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1682280212, now seen corresponding path program 1 times [2024-09-24 23:25:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:32,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921428981] [2024-09-24 23:25:32,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:25:32,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1569445702] [2024-09-24 23:25:32,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:32,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:32,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:32,890 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:32,896 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:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:32,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-24 23:25:32,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:25:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:33,051 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:25:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:36,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:36,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921428981] [2024-09-24 23:25:36,846 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:25:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569445702] [2024-09-24 23:25:36,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569445702] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:25:36,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:25:36,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-24 23:25:36,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970787374] [2024-09-24 23:25:36,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:25:36,847 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-24 23:25:36,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:36,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-24 23:25:36,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-24 23:25:36,848 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-24 23:25:47,837 WARN L293 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 29 DAG size of output: 21 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-24 23:25:51,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:25:53,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:25:58,509 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:04,857 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:08,979 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:13,696 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:17,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:26:21,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:26:25,733 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:30,142 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:34,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:26:38,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:26:42,184 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:46,201 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:50,904 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:55,263 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:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:26:55,270 INFO L93 Difference]: Finished difference Result 156 states and 226 transitions. [2024-09-24 23:26:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:26:55,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2024-09-24 23:26:55,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:26:55,272 INFO L225 Difference]: With dead ends: 156 [2024-09-24 23:26:55,272 INFO L226 Difference]: Without dead ends: 132 [2024-09-24 23:26:55,272 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-09-24 23:26:55,273 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 55 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.5s IncrementalHoareTripleChecker+Time [2024-09-24 23:26:55,273 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 297 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 198 Invalid, 15 Unknown, 0 Unchecked, 67.5s Time] [2024-09-24 23:26:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-09-24 23:26:55,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-09-24 23:26:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-09-24 23:26:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-09-24 23:26:55,294 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 32 [2024-09-24 23:26:55,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:26:55,294 INFO L474 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-09-24 23:26:55,294 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-24 23:26:55,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:26:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-09-24 23:26:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-24 23:26:55,296 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:26:55,296 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:26:55,302 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:26:55,499 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:26:55,500 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:26:55,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:26:55,500 INFO L85 PathProgramCache]: Analyzing trace with hash -7962503, now seen corresponding path program 1 times [2024-09-24 23:26:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:26:55,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386377805] [2024-09-24 23:26:55,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:26:55,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:26:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:26:55,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683095456] [2024-09-24 23:26:55,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:26:55,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:26:55,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:26:55,528 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:26:55,529 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:26:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:26:55,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-24 23:26:55,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:26:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-24 23:26:55,764 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:26:55,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:26:55,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386377805] [2024-09-24 23:26:55,765 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:26:55,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683095456] [2024-09-24 23:26:55,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683095456] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:26:55,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:26:55,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-24 23:26:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883371942] [2024-09-24 23:26:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:26:55,766 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 23:26:55,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:26:55,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 23:26:55,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-24 23:26:55,767 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:26:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:26:56,155 INFO L93 Difference]: Finished difference Result 140 states and 191 transitions. [2024-09-24 23:26:56,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:26:56,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-09-24 23:26:56,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:26:56,157 INFO L225 Difference]: With dead ends: 140 [2024-09-24 23:26:56,157 INFO L226 Difference]: Without dead ends: 138 [2024-09-24 23:26:56,158 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-24 23:26:56,158 INFO L434 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-24 23:26:56,159 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 256 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-24 23:26:56,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-24 23:26:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-09-24 23:26:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 67 states have (on average 1.164179104477612) internal successors, (78), 70 states have internal predecessors, (78), 57 states have call successors, (57), 14 states have call predecessors, (57), 13 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-09-24 23:26:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 189 transitions. [2024-09-24 23:26:56,183 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 189 transitions. Word has length 44 [2024-09-24 23:26:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:26:56,184 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 189 transitions. [2024-09-24 23:26:56,184 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:26:56,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:26:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 189 transitions. [2024-09-24 23:26:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-24 23:26:56,186 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:26:56,186 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:26:56,200 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:26:56,390 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:26:56,391 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:26:56,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:26:56,391 INFO L85 PathProgramCache]: Analyzing trace with hash -409333978, now seen corresponding path program 1 times [2024-09-24 23:26:56,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:26:56,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374123589] [2024-09-24 23:26:56,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:26:56,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:26:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:26:56,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228557981] [2024-09-24 23:26:56,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:26:56,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:26:56,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:26:56,420 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:26:56,420 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:26:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:26:56,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-24 23:26:56,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:26:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-24 23:26:56,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:27:13,091 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:27:17,109 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 4294967295 c_main_~n~0) c_main_~r~0 (* c_main_~p~0 c_main_~p~0)) 4294967296) 0) (forall ((main_~q~0 Int)) (not (= (mod (+ (* main_~q~0 main_~q~0 4294967295 c_main_~h~0) (* 4294967292 main_~q~0 main_~q~0 c_main_~p~0) (* main_~q~0 c_main_~r~0 12 c_main_~h~0) (* main_~q~0 16 c_main_~p~0 c_main_~n~0) (* c_main_~h~0 c_main_~h~0 c_main_~h~0) (* main_~q~0 c_main_~n~0 4294967284 c_main_~h~0) (* main_~q~0 c_main_~p~0 c_main_~r~0 4294967280)) 4294967296) 0)))) is different from false [2024-09-24 23:27:17,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:27:17,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374123589] [2024-09-24 23:27:17,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:27:17,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228557981] [2024-09-24 23:27:17,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228557981] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:27:17,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:27:17,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-24 23:27:17,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635913906] [2024-09-24 23:27:17,115 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-24 23:27:17,115 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 23:27:17,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:27:17,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 23:27:17,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-09-24 23:27:17,117 INFO L87 Difference]: Start difference. First operand 138 states and 189 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-24 23:27:18,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:27:22,621 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:27:26,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:27:30,693 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:27:34,703 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:27:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:27:34,751 INFO L93 Difference]: Finished difference Result 156 states and 216 transitions. [2024-09-24 23:27:34,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:27:34,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2024-09-24 23:27:34,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:27:34,753 INFO L225 Difference]: With dead ends: 156 [2024-09-24 23:27:34,753 INFO L226 Difference]: Without dead ends: 138 [2024-09-24 23:27:34,754 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-09-24 23:27:34,754 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 24 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2024-09-24 23:27:34,754 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 120 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 119 Invalid, 4 Unknown, 0 Unchecked, 17.6s Time] [2024-09-24 23:27:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-24 23:27:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-09-24 23:27:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 56 states have call successors, (56), 14 states have call predecessors, (56), 13 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-24 23:27:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 188 transitions. [2024-09-24 23:27:34,782 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 188 transitions. Word has length 59 [2024-09-24 23:27:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:27:34,783 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 188 transitions. [2024-09-24 23:27:34,783 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-24 23:27:34,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:27:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 188 transitions. [2024-09-24 23:27:34,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-24 23:27:34,788 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:27:34,788 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:27:34,801 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:27:34,989 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-24 23:27:34,989 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:27:34,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:27:34,989 INFO L85 PathProgramCache]: Analyzing trace with hash 382001091, now seen corresponding path program 1 times [2024-09-24 23:27:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:27:34,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757324796] [2024-09-24 23:27:34,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:27:34,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:27:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:35,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:27:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:35,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:27:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:35,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:27:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:35,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:27:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:35,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-24 23:27:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:35,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-24 23:27:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:35,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-24 23:27:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:35,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-24 23:27:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:35,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-24 23:27:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-24 23:27:35,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:27:35,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757324796] [2024-09-24 23:27:35,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757324796] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:27:35,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964025636] [2024-09-24 23:27:35,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:27:35,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:27:35,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:27:35,740 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:27:35,741 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-24 23:27:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:35,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-24 23:27:35,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:27:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-24 23:27:36,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:28:09,216 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-24 23:28:17,407 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:28:29,907 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:28:37,996 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:28:46,158 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:28:58,351 WARN L293 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:29:10,461 WARN L293 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:29:18,605 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:29:30,714 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:29:51,110 WARN L293 SmtUtils]: Spent 16.21s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:29:55,142 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (div (mod c_main_~q~0 4294967296) 4))) (let ((.cse2 (mod (+ (* 2 c_main_~p~0) c_main_~q~0) 4294967296)) (.cse9 (mod (+ (* 4294967295 .cse4) (* 4294967295 c_main_~p~0)) 4294967296)) (.cse1 (mod (+ (* 4294967295 (mod c_main_~p~0 2)) (* 3 .cse4) c_main_~p~0) 4294967296)) (.cse5 (* c_main_~q~0 c_main_~q~0 4294967295 c_main_~p~0)) (.cse6 (* c_main_~p~0 c_main_~h~0 c_main_~h~0)) (.cse7 (* c_main_~q~0 c_main_~p~0 c_main_~n~0 4)) (.cse8 (* 4294967292 c_main_~q~0 c_main_~n~0 c_main_~h~0))) (and (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse3 (* v_y_6 4294967296)) (.cse0 (+ v_z_6 .cse9))) (or (< .cse0 .cse1) (< .cse2 (+ .cse3 v_z_6 1)) (< (+ .cse3 v_z_6) (mod (+ c_main_~p~0 .cse4) 4294967296)) (< v_z_6 0) (< 4294967295 .cse0) (not (= (mod (+ .cse5 (* c_main_~q~0 v_z_6 4 c_main_~h~0) .cse6 .cse7 (* 4294967292 c_main_~q~0 c_main_~p~0 v_z_6) .cse8) 4294967296) 0))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse10 (* v_y_6 4294967296))) (or (< 4294967295 v_z_6) (< .cse2 (+ .cse10 v_z_6 1)) (< (+ .cse10 v_z_6) 0) (< (+ v_z_6 .cse9) (+ 4294967296 .cse1)) (not (= (mod (+ .cse5 (* c_main_~q~0 v_z_6 4 c_main_~h~0) .cse6 .cse7 (* 4294967292 c_main_~q~0 c_main_~p~0 v_z_6) .cse8) 4294967296) 0)))))))) is different from true [2024-09-24 23:29:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964025636] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:29:55,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:29:55,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2024-09-24 23:29:55,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315107995] [2024-09-24 23:29:55,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:29:55,144 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-24 23:29:55,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:29:55,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-24 23:29:55,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=473, Unknown=3, NotChecked=44, Total=600 [2024-09-24 23:29:55,145 INFO L87 Difference]: Start difference. First operand 138 states and 188 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-24 23:30:00,228 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:30:04,252 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:30:08,373 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:30:12,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:30:13,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []