./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/dijkstra-u.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench/dijkstra-u.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b586a178399b4c0df2fdcb66faa06566663e0a18b90a5f0ce0551810014ff769 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:38:12,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:38:12,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:38:12,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:38:12,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:38:12,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:38:12,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:38:12,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:38:12,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:38:12,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:38:12,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:38:12,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:38:12,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:38:12,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:38:12,381 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:38:12,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:38:12,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:38:12,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:38:12,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:38:12,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:38:12,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:38:12,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:38:12,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:38:12,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:38:12,387 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:38:12,387 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:38:12,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:38:12,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:38:12,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:38:12,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:38:12,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:38:12,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:38:12,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:38:12,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:38:12,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:38:12,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:38:12,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:38:12,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:38:12,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:38:12,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:38:12,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:38:12,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:38:12,393 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 -> b586a178399b4c0df2fdcb66faa06566663e0a18b90a5f0ce0551810014ff769 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:38:12,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:38:12,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:38:12,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:38:12,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:38:12,751 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:38:12,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench/dijkstra-u.c [2024-09-25 10:38:14,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:38:14,512 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:38:14,513 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/dijkstra-u.c [2024-09-25 10:38:14,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/f284700bf/8bf9b7a806284e3886a66d73532f2de4/FLAGfd8832898 [2024-09-25 10:38:14,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/f284700bf/8bf9b7a806284e3886a66d73532f2de4 [2024-09-25 10:38:14,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:38:14,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:38:14,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:38:14,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:38:14,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:38:14,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:38:14" (1/1) ... [2024-09-25 10:38:14,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a9a6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:14, skipping insertion in model container [2024-09-25 10:38:14,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:38:14" (1/1) ... [2024-09-25 10:38:14,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:38:15,022 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/dijkstra-u.c[525,538] [2024-09-25 10:38:15,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:38:15,073 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:38:15,084 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/dijkstra-u.c[525,538] [2024-09-25 10:38:15,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:38:15,126 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:38:15,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15 WrapperNode [2024-09-25 10:38:15,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:38:15,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:38:15,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:38:15,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:38:15,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (1/1) ... [2024-09-25 10:38:15,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (1/1) ... [2024-09-25 10:38:15,155 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:38:15,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:38:15,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:38:15,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:38:15,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:38:15,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (1/1) ... [2024-09-25 10:38:15,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (1/1) ... [2024-09-25 10:38:15,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (1/1) ... [2024-09-25 10:38:15,188 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:38:15,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (1/1) ... [2024-09-25 10:38:15,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (1/1) ... [2024-09-25 10:38:15,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (1/1) ... [2024-09-25 10:38:15,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (1/1) ... [2024-09-25 10:38:15,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (1/1) ... [2024-09-25 10:38:15,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (1/1) ... [2024-09-25 10:38:15,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:38:15,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:38:15,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:38:15,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:38:15,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (1/1) ... [2024-09-25 10:38:15,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:38:15,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:38:15,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:38:15,246 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:38:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:38:15,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:38:15,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:38:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:38:15,304 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:38:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:38:15,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:38:15,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:38:15,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:38:15,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:38:15,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:38:15,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:38:15,367 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:38:15,370 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:38:15,641 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 10:38:15,641 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:38:15,659 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:38:15,659 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:38:15,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:38:15 BoogieIcfgContainer [2024-09-25 10:38:15,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:38:15,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:38:15,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:38:15,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:38:15,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:38:14" (1/3) ... [2024-09-25 10:38:15,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a8d7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:38:15, skipping insertion in model container [2024-09-25 10:38:15,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:38:15" (2/3) ... [2024-09-25 10:38:15,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a8d7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:38:15, skipping insertion in model container [2024-09-25 10:38:15,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:38:15" (3/3) ... [2024-09-25 10:38:15,670 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u.c [2024-09-25 10:38:15,686 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:38:15,687 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:38:15,744 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:38:15,751 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;@5322a0d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:38:15,752 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:38:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:38:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:38:15,764 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:38:15,764 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:38:15,765 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:38:15,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:38:15,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1413296547, now seen corresponding path program 1 times [2024-09-25 10:38:15,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:38:15,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633767036] [2024-09-25 10:38:15,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:38:15,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:38:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:38:15,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:38:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:38:15,952 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:38:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:38:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:38:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:38:15,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633767036] [2024-09-25 10:38:15,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633767036] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:38:15,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:38:15,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:38:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044639863] [2024-09-25 10:38:15,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:38:15,977 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:38:15,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:38:16,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:38:16,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:38:16,005 INFO L87 Difference]: Start difference. First operand has 35 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:38:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:38:16,042 INFO L93 Difference]: Finished difference Result 62 states and 102 transitions. [2024-09-25 10:38:16,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:38:16,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-25 10:38:16,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:38:16,053 INFO L225 Difference]: With dead ends: 62 [2024-09-25 10:38:16,053 INFO L226 Difference]: Without dead ends: 31 [2024-09-25 10:38:16,057 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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-25 10:38:16,062 INFO L434 NwaCegarLoop]: 43 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, 43 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-25 10:38:16,063 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:38:16,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-25 10:38:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-25 10:38:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 10:38:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-09-25 10:38:16,099 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2024-09-25 10:38:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:38:16,100 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-09-25 10:38:16,100 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:38:16,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:38:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-09-25 10:38:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-25 10:38:16,102 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:38:16,102 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:38:16,102 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:38:16,102 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:38:16,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:38:16,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1248341200, now seen corresponding path program 1 times [2024-09-25 10:38:16,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:38:16,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708087251] [2024-09-25 10:38:16,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:38:16,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:38:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:38:16,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:38:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:38:16,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:38:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:38:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:38:16,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:38:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708087251] [2024-09-25 10:38:16,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708087251] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:38:16,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:38:16,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:38:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875513149] [2024-09-25 10:38:16,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:38:16,548 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:38:16,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:38:16,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:38:16,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:38:16,549 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:38:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:38:16,807 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2024-09-25 10:38:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:38:16,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-25 10:38:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:38:16,811 INFO L225 Difference]: With dead ends: 63 [2024-09-25 10:38:16,812 INFO L226 Difference]: Without dead ends: 45 [2024-09-25 10:38:16,813 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:38:16,814 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:38:16,816 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 174 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:38:16,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-25 10:38:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-25 10:38:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 18 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-25 10:38:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-09-25 10:38:16,840 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 18 [2024-09-25 10:38:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:38:16,841 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-09-25 10:38:16,841 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:38:16,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:38:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-09-25 10:38:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 10:38:16,842 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:38:16,842 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:38:16,842 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:38:16,843 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:38:16,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:38:16,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1903651755, now seen corresponding path program 1 times [2024-09-25 10:38:16,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:38:16,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141188364] [2024-09-25 10:38:16,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:38:16,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:38:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:38:17,198 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:38:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:38:17,202 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:38:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:38:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:38:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:38:17,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141188364] [2024-09-25 10:38:17,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141188364] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:38:17,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854644116] [2024-09-25 10:38:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:38:17,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:38:17,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:38:17,213 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:38:17,215 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:38:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:38:17,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 10:38:17,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:38:17,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:38:17,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:38:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:38:17,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854644116] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:38:17,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:38:17,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-25 10:38:17,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237666841] [2024-09-25 10:38:17,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:38:17,628 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 10:38:17,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:38:17,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 10:38:17,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:38:17,629 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:38:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:38:19,007 INFO L93 Difference]: Finished difference Result 114 states and 179 transitions. [2024-09-25 10:38:19,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 10:38:19,007 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-25 10:38:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:38:19,010 INFO L225 Difference]: With dead ends: 114 [2024-09-25 10:38:19,012 INFO L226 Difference]: Without dead ends: 96 [2024-09-25 10:38:19,013 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-09-25 10:38:19,015 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:38:19,015 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 279 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-09-25 10:38:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-25 10:38:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 64. [2024-09-25 10:38:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-25 10:38:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2024-09-25 10:38:19,048 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 20 [2024-09-25 10:38:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:38:19,049 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2024-09-25 10:38:19,049 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:38:19,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:38:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2024-09-25 10:38:19,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-25 10:38:19,050 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:38:19,050 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:38:19,071 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 10:38:19,257 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:38:19,258 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:38:19,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:38:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1142714768, now seen corresponding path program 1 times [2024-09-25 10:38:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:38:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114448349] [2024-09-25 10:38:19,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:38:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:38:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:38:19,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759116159] [2024-09-25 10:38:19,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:38:19,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:38:19,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:38:19,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:38:19,292 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:38:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:38:19,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:38:19,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:38:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:38:19,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:38:19,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:38:19,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114448349] [2024-09-25 10:38:19,418 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:38:19,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759116159] [2024-09-25 10:38:19,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759116159] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:38:19,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:38:19,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:38:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920154890] [2024-09-25 10:38:19,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:38:19,419 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:38:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:38:19,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:38:19,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:38:19,422 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:38:19,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:38:19,530 INFO L93 Difference]: Finished difference Result 89 states and 125 transitions. [2024-09-25 10:38:19,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:38:19,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-25 10:38:19,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:38:19,534 INFO L225 Difference]: With dead ends: 89 [2024-09-25 10:38:19,535 INFO L226 Difference]: Without dead ends: 86 [2024-09-25 10:38:19,535 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:38:19,536 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:38:19,538 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 130 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:38:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-25 10:38:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-09-25 10:38:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-09-25 10:38:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2024-09-25 10:38:19,563 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 28 [2024-09-25 10:38:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:38:19,563 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2024-09-25 10:38:19,563 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:38:19,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:38:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2024-09-25 10:38:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 10:38:19,565 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:38:19,566 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:38:19,582 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-25 10:38:19,769 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:38:19,770 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:38:19,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:38:19,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1314960995, now seen corresponding path program 1 times [2024-09-25 10:38:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:38:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377223852] [2024-09-25 10:38:19,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:38:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:38:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:38:19,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989194804] [2024-09-25 10:38:19,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:38:19,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:38:19,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:38:19,789 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:38:19,790 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:38:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:38:19,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-25 10:38:19,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:38:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:38:19,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:38:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:38:22,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:38:22,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377223852] [2024-09-25 10:38:22,070 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:38:22,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989194804] [2024-09-25 10:38:22,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989194804] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:38:22,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:38:22,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-25 10:38:22,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89030735] [2024-09-25 10:38:22,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:38:22,071 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 10:38:22,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:38:22,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 10:38:22,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:38:22,072 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 10:38:30,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:38:35,357 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-25 10:38:39,505 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-25 10:38:42,118 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-25 10:38:46,366 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-25 10:38:50,382 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-25 10:38:54,989 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-25 10:38:58,999 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-25 10:39:03,006 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-25 10:39:07,844 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-25 10:39:12,629 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-25 10:39:18,189 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-25 10:39:22,193 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-25 10:39:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:39:22,814 INFO L93 Difference]: Finished difference Result 155 states and 224 transitions. [2024-09-25 10:39:22,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:39:22,814 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-09-25 10:39:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:39:22,816 INFO L225 Difference]: With dead ends: 155 [2024-09-25 10:39:22,816 INFO L226 Difference]: Without dead ends: 131 [2024-09-25 10:39:22,818 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:39:22,819 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 19 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 51 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:39:22,819 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 322 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 209 Invalid, 12 Unknown, 0 Unchecked, 54.4s Time] [2024-09-25 10:39:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-09-25 10:39:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2024-09-25 10:39:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 56 states have call successors, (56), 11 states have call predecessors, (56), 10 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-25 10:39:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 178 transitions. [2024-09-25 10:39:22,851 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 178 transitions. Word has length 27 [2024-09-25 10:39:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:39:22,852 INFO L474 AbstractCegarLoop]: Abstraction has 125 states and 178 transitions. [2024-09-25 10:39:22,852 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 10:39:22,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 178 transitions. [2024-09-25 10:39:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-25 10:39:22,854 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:39:22,854 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:39:22,861 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:39:23,054 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-25 10:39:23,055 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:39:23,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:23,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2083654722, now seen corresponding path program 1 times [2024-09-25 10:39:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:39:23,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777032671] [2024-09-25 10:39:23,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:23,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:39:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:39:23,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597094115] [2024-09-25 10:39:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:23,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:39:23,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:39:23,107 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:39:23,109 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:39:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:23,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 10:39:23,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:39:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 10:39:23,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:39:23,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:39:23,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777032671] [2024-09-25 10:39:23,357 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:39:23,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597094115] [2024-09-25 10:39:23,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597094115] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:39:23,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:39:23,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-25 10:39:23,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458761292] [2024-09-25 10:39:23,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:39:23,361 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:39:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:39:23,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:39:23,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:39:23,362 INFO L87 Difference]: Start difference. First operand 125 states and 178 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:39:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:39:23,711 INFO L93 Difference]: Finished difference Result 139 states and 189 transitions. [2024-09-25 10:39:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:39:23,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-09-25 10:39:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:39:23,715 INFO L225 Difference]: With dead ends: 139 [2024-09-25 10:39:23,715 INFO L226 Difference]: Without dead ends: 137 [2024-09-25 10:39:23,715 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:39:23,716 INFO L434 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:39:23,716 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 218 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:39:23,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-09-25 10:39:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-09-25 10:39:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 67 states have (on average 1.164179104477612) internal successors, (78), 70 states have internal predecessors, (78), 56 states have call successors, (56), 14 states have call predecessors, (56), 13 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-25 10:39:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 187 transitions. [2024-09-25 10:39:23,753 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 187 transitions. Word has length 39 [2024-09-25 10:39:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:39:23,754 INFO L474 AbstractCegarLoop]: Abstraction has 137 states and 187 transitions. [2024-09-25 10:39:23,754 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 10:39:23,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 187 transitions. [2024-09-25 10:39:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-25 10:39:23,758 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:39:23,758 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:39:23,772 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:39:23,958 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-25 10:39:23,959 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:39:23,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:39:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1819175000, now seen corresponding path program 1 times [2024-09-25 10:39:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:39:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645025598] [2024-09-25 10:39:23,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:39:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:39:24,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324646068] [2024-09-25 10:39:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:39:24,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:39:24,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:39:24,013 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:39:24,018 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:39:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:39:24,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 10:39:24,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:39:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-09-25 10:39:24,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:39:28,456 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 4294967295 c_main_~n~0) c_main_~r~0 (* c_main_~p~0 c_main_~p~0)) 4294967296) 0) (not (= (mod (+ (* c_main_~r~0 12 c_main_~h~0) (* 4294967295 c_main_~h~0) (* c_main_~h~0 c_main_~h~0 c_main_~h~0) (* c_main_~n~0 4294967284 c_main_~h~0) (* c_main_~p~0 c_main_~r~0 4294967280) (* 16 c_main_~p~0 c_main_~n~0) (* 4294967292 c_main_~p~0)) 4294967296) 0))) is different from false [2024-09-25 10:39:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-09-25 10:39:59,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:39:59,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645025598] [2024-09-25 10:39:59,144 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:39:59,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324646068] [2024-09-25 10:39:59,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324646068] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:39:59,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:39:59,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-09-25 10:39:59,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573068855] [2024-09-25 10:39:59,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:39:59,145 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:39:59,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:39:59,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:39:59,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2024-09-25 10:39:59,146 INFO L87 Difference]: Start difference. First operand 137 states and 187 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-25 10:40:03,728 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-25 10:40:07,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-25 10:40:11,814 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-25 10:40:15,831 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-25 10:40:17,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:40:18,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 10:40:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:18,937 INFO L93 Difference]: Finished difference Result 155 states and 214 transitions. [2024-09-25 10:40:18,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:40:18,938 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 54 [2024-09-25 10:40:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:18,939 INFO L225 Difference]: With dead ends: 155 [2024-09-25 10:40:18,940 INFO L226 Difference]: Without dead ends: 137 [2024-09-25 10:40:18,940 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=33, Invalid=80, Unknown=1, NotChecked=18, Total=132 [2024-09-25 10:40:18,941 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 25 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:18,941 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 170 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 161 Invalid, 4 Unknown, 35 Unchecked, 19.7s Time] [2024-09-25 10:40:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-09-25 10:40:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-09-25 10:40:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 55 states have call successors, (55), 14 states have call predecessors, (55), 13 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-09-25 10:40:18,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 186 transitions. [2024-09-25 10:40:18,964 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 186 transitions. Word has length 54 [2024-09-25 10:40:18,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:18,964 INFO L474 AbstractCegarLoop]: Abstraction has 137 states and 186 transitions. [2024-09-25 10:40:18,965 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-25 10:40:18,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:18,965 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2024-09-25 10:40:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-25 10:40:18,967 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:18,967 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:40:18,984 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:40:19,171 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-25 10:40:19,172 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:19,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:19,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2033276272, now seen corresponding path program 1 times [2024-09-25 10:40:19,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:19,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701028734] [2024-09-25 10:40:19,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:19,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:20,362 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:40:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:20,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:40:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:20,369 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 10:40:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:20,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:40:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:20,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:40:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:20,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:40:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:20,426 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:40:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:20,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 10:40:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:40:20,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701028734] [2024-09-25 10:40:20,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701028734] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:40:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888102389] [2024-09-25 10:40:20,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:20,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:40:20,471 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:40:20,472 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:40:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:20,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-25 10:40:20,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:40:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-09-25 10:40:21,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:40:43,962 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:41:08,490 WARN L293 SmtUtils]: Spent 16.12s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:41:24,694 WARN L293 SmtUtils]: Spent 16.11s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:41:41,307 WARN L293 SmtUtils]: Spent 12.46s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:41:57,977 WARN L293 SmtUtils]: Spent 16.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:42:10,373 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:42:40,502 WARN L293 SmtUtils]: Spent 28.67s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)