./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound5.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound5.i -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 d02047a3b9d197f6609f19d430d458b8d82d1972f1adb7857eb26188e13a592b --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 00:17:46,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 00:17:46,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 00:17:46,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 00:17:46,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 00:17:46,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 00:17:46,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 00:17:46,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 00:17:46,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 00:17:46,508 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 00:17:46,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 00:17:46,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 00:17:46,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 00:17:46,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 00:17:46,511 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 00:17:46,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 00:17:46,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 00:17:46,512 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 00:17:46,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 00:17:46,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 00:17:46,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 00:17:46,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 00:17:46,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 00:17:46,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 00:17:46,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 00:17:46,515 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 00:17:46,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 00:17:46,515 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 00:17:46,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 00:17:46,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 00:17:46,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 00:17:46,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 00:17:46,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:17:46,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 00:17:46,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 00:17:46,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 00:17:46,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 00:17:46,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 00:17:46,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 00:17:46,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 00:17:46,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 00:17:46,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 00:17:46,519 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 -> d02047a3b9d197f6609f19d430d458b8d82d1972f1adb7857eb26188e13a592b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 00:17:46,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 00:17:46,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 00:17:46,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 00:17:46,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 00:17:46,822 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 00:17:46,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound5.i [2024-09-13 00:17:48,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 00:17:48,379 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 00:17:48,379 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound5.i [2024-09-13 00:17:48,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/3b239b7f4/66882cacfa1b49a78663cd73b7da7955/FLAGbd35112ef [2024-09-13 00:17:48,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/3b239b7f4/66882cacfa1b49a78663cd73b7da7955 [2024-09-13 00:17:48,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 00:17:48,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 00:17:48,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 00:17:48,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 00:17:48,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 00:17:48,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:17:48" (1/1) ... [2024-09-13 00:17:48,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b80bb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:48, skipping insertion in model container [2024-09-13 00:17:48,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:17:48" (1/1) ... [2024-09-13 00:17:48,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 00:17:48,954 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound5.i[950,963] [2024-09-13 00:17:48,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:17:48,988 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 00:17:49,001 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound5.i[950,963] [2024-09-13 00:17:49,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:17:49,026 INFO L204 MainTranslator]: Completed translation [2024-09-13 00:17:49,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49 WrapperNode [2024-09-13 00:17:49,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 00:17:49,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 00:17:49,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 00:17:49,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 00:17:49,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (1/1) ... [2024-09-13 00:17:49,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (1/1) ... [2024-09-13 00:17:49,055 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 00:17:49,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 00:17:49,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 00:17:49,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 00:17:49,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 00:17:49,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (1/1) ... [2024-09-13 00:17:49,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (1/1) ... [2024-09-13 00:17:49,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (1/1) ... [2024-09-13 00:17:49,082 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-13 00:17:49,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (1/1) ... [2024-09-13 00:17:49,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (1/1) ... [2024-09-13 00:17:49,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (1/1) ... [2024-09-13 00:17:49,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (1/1) ... [2024-09-13 00:17:49,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (1/1) ... [2024-09-13 00:17:49,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (1/1) ... [2024-09-13 00:17:49,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 00:17:49,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 00:17:49,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 00:17:49,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 00:17:49,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (1/1) ... [2024-09-13 00:17:49,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:17:49,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:17:49,138 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-13 00:17:49,141 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-13 00:17:49,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 00:17:49,191 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 00:17:49,191 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 00:17:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 00:17:49,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 00:17:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 00:17:49,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 00:17:49,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 00:17:49,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 00:17:49,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 00:17:49,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 00:17:49,194 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 00:17:49,257 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 00:17:49,259 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 00:17:49,412 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 00:17:49,412 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 00:17:49,430 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 00:17:49,431 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 00:17:49,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:17:49 BoogieIcfgContainer [2024-09-13 00:17:49,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 00:17:49,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 00:17:49,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 00:17:49,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 00:17:49,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 12:17:48" (1/3) ... [2024-09-13 00:17:49,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe5c12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:17:49, skipping insertion in model container [2024-09-13 00:17:49,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:17:49" (2/3) ... [2024-09-13 00:17:49,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe5c12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:17:49, skipping insertion in model container [2024-09-13 00:17:49,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:17:49" (3/3) ... [2024-09-13 00:17:49,448 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_valuebound5.i [2024-09-13 00:17:49,463 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 00:17:49,463 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 00:17:49,507 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 00:17:49,512 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;@245e0989, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 00:17:49,512 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 00:17:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 00:17:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-13 00:17:49,521 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:17:49,522 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:17:49,522 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:17:49,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:17:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash -923394275, now seen corresponding path program 1 times [2024-09-13 00:17:49,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:17:49,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481584705] [2024-09-13 00:17:49,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:17:49,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:17:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:49,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:17:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:49,699 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:17:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:49,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:17:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:49,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:17:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:49,725 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:17:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:17:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:17:49,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481584705] [2024-09-13 00:17:49,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481584705] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:17:49,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:17:49,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 00:17:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000855737] [2024-09-13 00:17:49,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:17:49,743 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 00:17:49,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:17:49,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 00:17:49,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:17:49,768 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 00:17:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:17:49,792 INFO L93 Difference]: Finished difference Result 58 states and 87 transitions. [2024-09-13 00:17:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 00:17:49,795 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-13 00:17:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:17:49,801 INFO L225 Difference]: With dead ends: 58 [2024-09-13 00:17:49,802 INFO L226 Difference]: Without dead ends: 28 [2024-09-13 00:17:49,805 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-13 00:17:49,808 INFO L434 NwaCegarLoop]: 36 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, 36 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-13 00:17:49,809 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:17:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-13 00:17:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-13 00:17:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 00:17:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-09-13 00:17:49,843 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 33 [2024-09-13 00:17:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:17:49,844 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-09-13 00:17:49,844 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 00:17:49,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:17:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-09-13 00:17:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-13 00:17:49,846 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:17:49,847 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:17:49,847 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 00:17:49,847 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:17:49,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:17:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1193042891, now seen corresponding path program 1 times [2024-09-13 00:17:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:17:49,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424088096] [2024-09-13 00:17:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:17:49,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:17:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:17:49,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397583983] [2024-09-13 00:17:49,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:17:49,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:17:49,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:17:49,907 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-13 00:17:49,909 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-13 00:17:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:49,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-13 00:17:50,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:17:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 00:17:50,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:17:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:17:50,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:17:50,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424088096] [2024-09-13 00:17:50,737 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:17:50,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397583983] [2024-09-13 00:17:50,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397583983] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 00:17:50,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 00:17:50,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-09-13 00:17:50,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990216534] [2024-09-13 00:17:50,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:17:50,739 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 00:17:50,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:17:50,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 00:17:50,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-13 00:17:50,743 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-13 00:17:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:17:50,998 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-09-13 00:17:50,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 00:17:50,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2024-09-13 00:17:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:17:51,000 INFO L225 Difference]: With dead ends: 40 [2024-09-13 00:17:51,000 INFO L226 Difference]: Without dead ends: 37 [2024-09-13 00:17:51,000 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-13 00:17:51,001 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 00:17:51,002 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 99 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 00:17:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-13 00:17:51,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-13 00:17:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 00:17:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-09-13 00:17:51,013 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 34 [2024-09-13 00:17:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:17:51,014 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-09-13 00:17:51,014 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-13 00:17:51,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:17:51,015 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-09-13 00:17:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-13 00:17:51,016 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:17:51,016 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:17:51,033 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 00:17:51,219 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:17:51,220 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:17:51,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:17:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash 336856806, now seen corresponding path program 1 times [2024-09-13 00:17:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:17:51,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616561611] [2024-09-13 00:17:51,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:17:51,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:17:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:17:51,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895138509] [2024-09-13 00:17:51,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:17:51,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:17:51,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:17:51,294 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-13 00:17:51,296 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-13 00:17:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:51,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-13 00:17:51,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:17:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-13 00:17:51,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:17:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-13 00:17:51,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:17:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616561611] [2024-09-13 00:17:51,892 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:17:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895138509] [2024-09-13 00:17:51,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895138509] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 00:17:51,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 00:17:51,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2024-09-13 00:17:51,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633225796] [2024-09-13 00:17:51,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:17:51,894 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 00:17:51,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:17:51,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 00:17:51,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-13 00:17:51,895 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-13 00:17:56,304 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 [1] [2024-09-13 00:17:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:17:56,449 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2024-09-13 00:17:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 00:17:56,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2024-09-13 00:17:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:17:56,451 INFO L225 Difference]: With dead ends: 47 [2024-09-13 00:17:56,451 INFO L226 Difference]: Without dead ends: 44 [2024-09-13 00:17:56,451 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-13 00:17:56,452 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-09-13 00:17:56,453 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 121 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-09-13 00:17:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-13 00:17:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2024-09-13 00:17:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 00:17:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-13 00:17:56,464 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 36 [2024-09-13 00:17:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:17:56,465 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-13 00:17:56,465 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-13 00:17:56,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:17:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-13 00:17:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-13 00:17:56,467 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:17:56,467 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:17:56,484 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-13 00:17:56,667 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:17:56,668 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:17:56,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:17:56,668 INFO L85 PathProgramCache]: Analyzing trace with hash 513117096, now seen corresponding path program 1 times [2024-09-13 00:17:56,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:17:56,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791187061] [2024-09-13 00:17:56,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:17:56,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:17:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:57,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:17:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:57,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:17:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:57,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:17:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:57,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:17:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:57,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:17:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:57,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 00:17:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:17:57,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:17:57,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791187061] [2024-09-13 00:17:57,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791187061] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:17:57,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:17:57,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 00:17:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507110739] [2024-09-13 00:17:57,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:17:57,236 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 00:17:57,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:17:57,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 00:17:57,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 00:17:57,237 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 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-13 00:17:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:17:57,285 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-09-13 00:17:57,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 00:17:57,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 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 42 [2024-09-13 00:17:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:17:57,287 INFO L225 Difference]: With dead ends: 51 [2024-09-13 00:17:57,287 INFO L226 Difference]: Without dead ends: 37 [2024-09-13 00:17:57,288 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 00:17:57,289 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:17:57,289 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:17:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-13 00:17:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-13 00:17:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 00:17:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-09-13 00:17:57,307 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 42 [2024-09-13 00:17:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:17:57,308 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-09-13 00:17:57,308 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 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-13 00:17:57,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:17:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-09-13 00:17:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-13 00:17:57,313 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:17:57,313 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:17:57,313 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 00:17:57,313 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:17:57,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:17:57,314 INFO L85 PathProgramCache]: Analyzing trace with hash 980542403, now seen corresponding path program 1 times [2024-09-13 00:17:57,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:17:57,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803635895] [2024-09-13 00:17:57,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:17:57,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:17:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:17:57,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115423309] [2024-09-13 00:17:57,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:17:57,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:17:57,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:17:57,346 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-13 00:17:57,347 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-13 00:17:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:17:57,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-13 00:17:57,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:17:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-13 00:17:57,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:18:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 00:18:06,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:18:06,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803635895] [2024-09-13 00:18:06,149 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:18:06,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115423309] [2024-09-13 00:18:06,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115423309] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:18:06,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 00:18:06,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2024-09-13 00:18:06,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026242026] [2024-09-13 00:18:06,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 00:18:06,150 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-13 00:18:06,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:18:06,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-13 00:18:06,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-09-13 00:18:06,152 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 6 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-09-13 00:18:09,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:18:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:18:12,894 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2024-09-13 00:18:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-13 00:18:12,895 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 6 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 44 [2024-09-13 00:18:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:18:12,898 INFO L225 Difference]: With dead ends: 61 [2024-09-13 00:18:12,898 INFO L226 Difference]: Without dead ends: 55 [2024-09-13 00:18:12,899 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2024-09-13 00:18:12,900 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-09-13 00:18:12,904 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 215 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-09-13 00:18:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-13 00:18:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2024-09-13 00:18:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 00:18:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-09-13 00:18:12,921 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 44 [2024-09-13 00:18:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:18:12,921 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-09-13 00:18:12,921 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 6 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-09-13 00:18:12,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:18:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-09-13 00:18:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-13 00:18:12,925 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:18:12,925 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:18:12,934 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 00:18:13,125 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-13 00:18:13,126 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:18:13,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:18:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2109238368, now seen corresponding path program 2 times [2024-09-13 00:18:13,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:18:13,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246710039] [2024-09-13 00:18:13,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:18:13,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:18:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:13,592 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:18:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:13,596 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:18:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:13,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 00:18:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:13,603 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:18:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:13,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 00:18:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:13,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 00:18:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:13,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 00:18:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:18:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-13 00:18:13,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:18:13,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246710039] [2024-09-13 00:18:13,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246710039] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:18:13,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561585397] [2024-09-13 00:18:13,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 00:18:13,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:18:13,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:18:13,632 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-13 00:18:13,633 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-13 00:18:13,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 00:18:13,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:18:13,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-13 00:18:13,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:18:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-13 00:18:14,297 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:18:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-13 00:18:14,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561585397] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:18:14,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 00:18:14,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 21 [2024-09-13 00:18:14,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79850513] [2024-09-13 00:18:14,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 00:18:14,717 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 00:18:14,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:18:14,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 00:18:14,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-09-13 00:18:14,719 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 21 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 9 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2024-09-13 00:18:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:18:15,284 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2024-09-13 00:18:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 00:18:15,285 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 9 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) Word has length 52 [2024-09-13 00:18:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:18:15,286 INFO L225 Difference]: With dead ends: 79 [2024-09-13 00:18:15,286 INFO L226 Difference]: Without dead ends: 52 [2024-09-13 00:18:15,287 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2024-09-13 00:18:15,288 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 00:18:15,288 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 248 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 00:18:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-13 00:18:15,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-09-13 00:18:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 33 states have internal predecessors, (35), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 00:18:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-09-13 00:18:15,315 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 52 [2024-09-13 00:18:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:18:15,315 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-09-13 00:18:15,316 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 9 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2024-09-13 00:18:15,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:18:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-09-13 00:18:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 00:18:15,320 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:18:15,320 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:18:15,328 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 00:18:15,520 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-13 00:18:15,521 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:18:15,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:18:15,522 INFO L85 PathProgramCache]: Analyzing trace with hash -860568069, now seen corresponding path program 3 times [2024-09-13 00:18:15,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:18:15,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162385080] [2024-09-13 00:18:15,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:18:15,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:18:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:18:15,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745299614] [2024-09-13 00:18:15,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 00:18:15,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:18:15,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:18:15,652 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-13 00:18:15,653 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-13 00:18:15,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 00:18:15,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:18:15,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-13 00:18:15,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:19:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 00:19:18,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:19:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-13 00:19:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:19:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162385080] [2024-09-13 00:19:27,669 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:19:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745299614] [2024-09-13 00:19:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745299614] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:19:27,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 00:19:27,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 24 [2024-09-13 00:19:27,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69892532] [2024-09-13 00:19:27,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 00:19:27,670 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-13 00:19:27,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:19:27,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-13 00:19:27,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2024-09-13 00:19:27,672 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 22 states have internal predecessors, (44), 9 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-09-13 00:21:12,470 WARN L293 SmtUtils]: Spent 1.66m on a formula simplification that was a NOOP. DAG size: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:21:16,963 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-13 00:21:20,969 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-13 00:21:22,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:21:26,917 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-13 00:21:37,304 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-13 00:21:41,308 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-13 00:22:41,539 WARN L293 SmtUtils]: Spent 58.66s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:23:03,578 WARN L293 SmtUtils]: Spent 21.10s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:23:06,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:23:08,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:23:12,522 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-13 00:23:31,765 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-13 00:23:35,976 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-13 00:25:14,410 WARN L293 SmtUtils]: Spent 1.30m on a formula simplification that was a NOOP. DAG size: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:25:15,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:25:19,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:25:21,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:25:23,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:25:40,103 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-13 00:25:44,109 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-13 00:25:48,352 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-13 00:25:52,368 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-13 00:26:03,407 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-13 00:26:07,430 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-13 00:26:09,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:26:12,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:26:16,797 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-13 00:26:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:26:16,930 INFO L93 Difference]: Finished difference Result 130 states and 160 transitions. [2024-09-13 00:26:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-13 00:26:16,932 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 22 states have internal predecessors, (44), 9 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 54 [2024-09-13 00:26:16,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:26:16,934 INFO L225 Difference]: With dead ends: 130 [2024-09-13 00:26:16,934 INFO L226 Difference]: Without dead ends: 107 [2024-09-13 00:26:16,935 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 326.6s TimeCoverageRelationStatistics Valid=363, Invalid=1191, Unknown=6, NotChecked=0, Total=1560 [2024-09-13 00:26:16,936 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 92 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 54 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 91.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 91.2s IncrementalHoareTripleChecker+Time [2024-09-13 00:26:16,936 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 330 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 433 Invalid, 15 Unknown, 0 Unchecked, 91.2s Time] [2024-09-13 00:26:16,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-13 00:26:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2024-09-13 00:26:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.173913043478261) internal successors, (81), 74 states have internal predecessors, (81), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 00:26:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-09-13 00:26:16,999 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 54 [2024-09-13 00:26:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:26:17,000 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-09-13 00:26:17,000 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 22 states have internal predecessors, (44), 9 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-09-13 00:26:17,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:26:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-09-13 00:26:17,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-13 00:26:17,002 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:26:17,002 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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-13 00:26:17,011 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 00:26:17,202 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-13 00:26:17,203 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:26:17,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:26:17,203 INFO L85 PathProgramCache]: Analyzing trace with hash 872971988, now seen corresponding path program 1 times [2024-09-13 00:26:17,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:26:17,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170832851] [2024-09-13 00:26:17,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:26:17,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:26:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:26:17,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396916397] [2024-09-13 00:26:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:26:17,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:26:17,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:26:17,398 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-13 00:26:17,399 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-13 00:26:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:26:17,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-13 00:26:17,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:26:19,076 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 00:26:19,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:26:53,349 WARN L293 SmtUtils]: Spent 20.09s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:27:05,419 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:27:09,434 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~A~0 4294967296)) (.cse0 (mod c_main_~b~0 1073741824))) (or (< .cse0 (+ (mod (+ (* .cse0 4294967294) c_main_~r~0) 4294967296) 1)) (not (= (mod (+ (* c_main_~b~0 c_main_~q~0 4) c_main_~r~0) 4294967296) .cse1)) (= .cse1 (mod (+ (* .cse0 c_main_~q~0 4) c_main_~r~0) 4294967296)))) is different from true [2024-09-13 00:27:29,492 WARN L293 SmtUtils]: Spent 20.06s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:27:57,939 WARN L293 SmtUtils]: Spent 16.33s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:28:05,986 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~b~0 536870912)) (.cse0 (mod c_main_~A~0 4294967296))) (or (not (= .cse0 (mod (+ (* c_main_~b~0 c_main_~q~0 8) c_main_~r~0) 4294967296))) (< (* .cse1 2) (+ (mod (+ (* 4294967292 .cse1) c_main_~r~0) 4294967296) 1)) (= (mod (+ c_main_~r~0 (* .cse1 c_main_~q~0 8)) 4294967296) .cse0))) is different from true [2024-09-13 00:28:30,073 WARN L293 SmtUtils]: Spent 20.07s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:28:38,103 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:28:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 10 not checked. [2024-09-13 00:28:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:28:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170832851] [2024-09-13 00:28:38,127 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:28:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396916397] [2024-09-13 00:28:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396916397] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:28:38,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 00:28:38,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 27 [2024-09-13 00:28:38,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455880416] [2024-09-13 00:28:38,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 00:28:38,128 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-13 00:28:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:28:38,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-13 00:28:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=478, Unknown=2, NotChecked=94, Total=702 [2024-09-13 00:28:38,129 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 25 states have internal predecessors, (53), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-09-13 00:28:43,202 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-13 00:28:44,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:28:48,393 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-13 00:28:50,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:28:51,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:29:25,957 WARN L293 SmtUtils]: Spent 32.58s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:29:30,026 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-13 00:29:34,038 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-13 00:29:48,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:30:00,013 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-13 00:30:04,326 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-13 00:30:08,528 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-13 00:30:14,678 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-13 00:30:24,698 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-13 00:30:28,717 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-13 00:30:31,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:30:35,987 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-13 00:30:40,254 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-13 00:31:09,762 WARN L293 SmtUtils]: Spent 28.12s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:31:14,070 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-13 00:31:18,439 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-13 00:31:26,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:31:27,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:32:17,432 WARN L293 SmtUtils]: Spent 30.72s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15