./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/eureka_01-2.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/eureka_01-2.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 fc84672deb8568f357f3e53d1889a4a141611ae62422dd83eb7a6bc6f311a8b1 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:17:11,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:17:11,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:17:11,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:17:11,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:17:11,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:17:11,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:17:11,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:17:11,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:17:11,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:17:11,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:17:11,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:17:11,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:17:11,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:17:11,337 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:17:11,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:17:11,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:17:11,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:17:11,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:17:11,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:17:11,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:17:11,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:17:11,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:17:11,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:17:11,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:17:11,340 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:17:11,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:17:11,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:17:11,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:17:11,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:17:11,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:17:11,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:17:11,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:17:11,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:17:11,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:17:11,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:17:11,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:17:11,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:17:11,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:17:11,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:17:11,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:17:11,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:17:11,344 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 -> fc84672deb8568f357f3e53d1889a4a141611ae62422dd83eb7a6bc6f311a8b1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 19:17:11,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:17:11,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:17:11,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:17:11,591 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:17:11,592 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:17:11,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/eureka_01-2.c [2024-09-11 19:17:12,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:17:12,987 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:17:12,988 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/eureka_01-2.c [2024-09-11 19:17:12,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/2f7a46cea/070b62d640fb48a8aecb141a677497bd/FLAG1d80a0f6a [2024-09-11 19:17:13,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/2f7a46cea/070b62d640fb48a8aecb141a677497bd [2024-09-11 19:17:13,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:17:13,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:17:13,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:17:13,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:17:13,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:17:13,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee7c638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13, skipping insertion in model container [2024-09-11 19:17:13,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:17:13,134 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/eureka_01-2.c[323,336] [2024-09-11 19:17:13,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:17:13,166 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:17:13,175 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/eureka_01-2.c[323,336] [2024-09-11 19:17:13,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:17:13,213 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:17:13,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13 WrapperNode [2024-09-11 19:17:13,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:17:13,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:17:13,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:17:13,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:17:13,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,258 INFO L138 Inliner]: procedures = 13, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 198 [2024-09-11 19:17:13,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:17:13,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:17:13,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:17:13,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:17:13,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,295 INFO L175 MemorySlicer]: Split 78 memory accesses to 5 slices as follows [2, 22, 23, 22, 9]. 29 percent of accesses are in the largest equivalence class. The 62 initializations are split as follows [2, 20, 20, 20, 0]. The 3 writes are split as follows [0, 0, 0, 0, 3]. [2024-09-11 19:17:13,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:17:13,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:17:13,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:17:13,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:17:13,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:17:13,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:13,350 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-11 19:17:13,351 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-11 19:17:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:17:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:17:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 19:17:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-11 19:17:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-11 19:17:13,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-11 19:17:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-11 19:17:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-11 19:17:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-11 19:17:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-11 19:17:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-11 19:17:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-11 19:17:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:17:13,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:17:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-11 19:17:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-11 19:17:13,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-11 19:17:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-11 19:17:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-11 19:17:13,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-11 19:17:13,452 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:17:13,454 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:17:13,651 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-09-11 19:17:13,651 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:17:13,695 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:17:13,696 INFO L318 CfgBuilder]: Removed 5 assume(true) statements. [2024-09-11 19:17:13,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:17:13 BoogieIcfgContainer [2024-09-11 19:17:13,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:17:13,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:17:13,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:17:13,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:17:13,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:17:13" (1/3) ... [2024-09-11 19:17:13,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1764b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:17:13, skipping insertion in model container [2024-09-11 19:17:13,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (2/3) ... [2024-09-11 19:17:13,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1764b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:17:13, skipping insertion in model container [2024-09-11 19:17:13,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:17:13" (3/3) ... [2024-09-11 19:17:13,705 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01-2.c [2024-09-11 19:17:13,720 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:17:13,720 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:17:13,767 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:17:13,772 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;@34e86d1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:17:13,773 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:17:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.75) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:17:13,781 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:13,782 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:13,782 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:13,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash 969093160, now seen corresponding path program 1 times [2024-09-11 19:17:13,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:13,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023872961] [2024-09-11 19:17:13,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:13,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:13,959 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-11 19:17:13,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:13,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023872961] [2024-09-11 19:17:13,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023872961] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:17:13,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:17:13,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:17:13,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552856625] [2024-09-11 19:17:13,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:17:13,966 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:17:13,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:17:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:17:13,983 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.75) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:14,005 INFO L93 Difference]: Finished difference Result 40 states and 63 transitions. [2024-09-11 19:17:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:17:14,008 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-11 19:17:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:14,015 INFO L225 Difference]: With dead ends: 40 [2024-09-11 19:17:14,015 INFO L226 Difference]: Without dead ends: 19 [2024-09-11 19:17:14,017 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 19:17:14,021 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:14,021 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:17:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-11 19:17:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-11 19:17:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-09-11 19:17:14,046 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 10 [2024-09-11 19:17:14,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:14,047 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-09-11 19:17:14,047 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-09-11 19:17:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:17:14,049 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:14,049 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:14,049 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:17:14,049 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:14,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash 428348859, now seen corresponding path program 1 times [2024-09-11 19:17:14,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:14,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003386782] [2024-09-11 19:17:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:14,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:14,263 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-11 19:17:14,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:14,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003386782] [2024-09-11 19:17:14,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003386782] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:17:14,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:17:14,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:17:14,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417100722] [2024-09-11 19:17:14,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:17:14,268 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:17:14,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:14,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:17:14,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:17:14,269 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:14,316 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-09-11 19:17:14,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:17:14,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-11 19:17:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:14,317 INFO L225 Difference]: With dead ends: 37 [2024-09-11 19:17:14,317 INFO L226 Difference]: Without dead ends: 22 [2024-09-11 19:17:14,318 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:17:14,318 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:14,319 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:17:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-11 19:17:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-09-11 19:17:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-09-11 19:17:14,328 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2024-09-11 19:17:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:14,328 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-09-11 19:17:14,328 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-09-11 19:17:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-11 19:17:14,329 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:14,329 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:14,329 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:17:14,329 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:14,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash 980259699, now seen corresponding path program 1 times [2024-09-11 19:17:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:14,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795293436] [2024-09-11 19:17:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:14,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:17:14,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:14,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795293436] [2024-09-11 19:17:14,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795293436] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:17:14,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:17:14,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:17:14,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991482600] [2024-09-11 19:17:14,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:17:14,430 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:17:14,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:14,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:17:14,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:17:14,431 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:14,497 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2024-09-11 19:17:14,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:17:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-09-11 19:17:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:14,498 INFO L225 Difference]: With dead ends: 43 [2024-09-11 19:17:14,498 INFO L226 Difference]: Without dead ends: 34 [2024-09-11 19:17:14,499 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:17:14,501 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:14,501 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:17:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-11 19:17:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2024-09-11 19:17:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-09-11 19:17:14,512 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 13 [2024-09-11 19:17:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:14,512 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-09-11 19:17:14,513 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-09-11 19:17:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-11 19:17:14,515 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:14,515 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:14,515 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:17:14,515 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:14,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash 263824409, now seen corresponding path program 1 times [2024-09-11 19:17:14,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:14,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656472381] [2024-09-11 19:17:14,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:14,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:17:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656472381] [2024-09-11 19:17:14,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656472381] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:17:14,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:17:14,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:17:14,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830261513] [2024-09-11 19:17:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:17:14,613 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:17:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:14,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:17:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:17:14,614 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:14,653 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-09-11 19:17:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:17:14,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-09-11 19:17:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:14,654 INFO L225 Difference]: With dead ends: 38 [2024-09-11 19:17:14,654 INFO L226 Difference]: Without dead ends: 24 [2024-09-11 19:17:14,655 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:17:14,655 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:14,656 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:17:14,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-11 19:17:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-09-11 19:17:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-09-11 19:17:14,666 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 16 [2024-09-11 19:17:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:14,666 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-09-11 19:17:14,666 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-09-11 19:17:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 19:17:14,668 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:14,668 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:14,668 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:17:14,668 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:14,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1728732986, now seen corresponding path program 1 times [2024-09-11 19:17:14,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:14,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339704874] [2024-09-11 19:17:14,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:14,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 19:17:14,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:14,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339704874] [2024-09-11 19:17:14,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339704874] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:17:14,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:17:14,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:17:14,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578161725] [2024-09-11 19:17:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:17:14,746 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:17:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:14,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:17:14,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:17:14,747 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:14,802 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2024-09-11 19:17:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:17:14,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-09-11 19:17:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:14,804 INFO L225 Difference]: With dead ends: 37 [2024-09-11 19:17:14,804 INFO L226 Difference]: Without dead ends: 31 [2024-09-11 19:17:14,804 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:17:14,805 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:14,805 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 20 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:17:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-11 19:17:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2024-09-11 19:17:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-09-11 19:17:14,811 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 19 [2024-09-11 19:17:14,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:14,811 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-09-11 19:17:14,811 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-09-11 19:17:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 19:17:14,812 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:14,812 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:14,812 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-11 19:17:14,813 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:14,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1802843216, now seen corresponding path program 1 times [2024-09-11 19:17:14,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:14,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569995078] [2024-09-11 19:17:14,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:14,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 19:17:14,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:14,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569995078] [2024-09-11 19:17:14,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569995078] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:17:14,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828483846] [2024-09-11 19:17:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:14,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:14,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:14,934 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-11 19:17:14,938 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-11 19:17:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:15,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:17:15,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:17:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 19:17:15,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:17:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 19:17:15,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828483846] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:17:15,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:17:15,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-09-11 19:17:15,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731315077] [2024-09-11 19:17:15,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:17:15,141 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 19:17:15,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:15,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 19:17:15,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:17:15,143 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:15,225 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2024-09-11 19:17:15,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:17:15,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-09-11 19:17:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:15,226 INFO L225 Difference]: With dead ends: 50 [2024-09-11 19:17:15,227 INFO L226 Difference]: Without dead ends: 32 [2024-09-11 19:17:15,227 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:17:15,228 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:15,228 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 33 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:17:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-11 19:17:15,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-11 19:17:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-11 19:17:15,241 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 21 [2024-09-11 19:17:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:15,241 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-11 19:17:15,241 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:15,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-11 19:17:15,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-11 19:17:15,243 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:15,243 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:15,257 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-11 19:17:15,445 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 19:17:15,446 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:15,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash 228079768, now seen corresponding path program 2 times [2024-09-11 19:17:15,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:15,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831835140] [2024-09-11 19:17:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 19:17:15,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:15,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831835140] [2024-09-11 19:17:15,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831835140] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:17:15,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934518268] [2024-09-11 19:17:15,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:17:15,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:15,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:15,566 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-11 19:17:15,570 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-11 19:17:15,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:17:15,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:17:15,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:17:15,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:17:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 19:17:15,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:17:15,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934518268] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:17:15,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:17:15,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-09-11 19:17:15,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557732765] [2024-09-11 19:17:15,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:17:15,706 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:17:15,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:15,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:17:15,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:17:15,707 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:15,742 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2024-09-11 19:17:15,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:17:15,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-09-11 19:17:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:15,743 INFO L225 Difference]: With dead ends: 58 [2024-09-11 19:17:15,743 INFO L226 Difference]: Without dead ends: 32 [2024-09-11 19:17:15,743 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:17:15,744 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:15,744 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:17:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-11 19:17:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-11 19:17:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-09-11 19:17:15,751 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2024-09-11 19:17:15,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:15,751 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-09-11 19:17:15,751 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:15,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-09-11 19:17:15,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-11 19:17:15,752 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:15,752 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:15,765 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-11 19:17:15,952 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 19:17:15,954 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:15,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:15,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1101460646, now seen corresponding path program 1 times [2024-09-11 19:17:15,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:15,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350515605] [2024-09-11 19:17:15,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:15,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 19:17:16,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:16,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350515605] [2024-09-11 19:17:16,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350515605] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:17:16,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609328009] [2024-09-11 19:17:16,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:16,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:16,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:16,079 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-11 19:17:16,081 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-11 19:17:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:16,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 19:17:16,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:17:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 19:17:16,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:17:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 19:17:16,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609328009] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:17:16,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:17:16,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-09-11 19:17:16,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010234249] [2024-09-11 19:17:16,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:17:16,322 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-11 19:17:16,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-11 19:17:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2024-09-11 19:17:16,323 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:16,385 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-09-11 19:17:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:17:16,385 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-09-11 19:17:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:16,386 INFO L225 Difference]: With dead ends: 55 [2024-09-11 19:17:16,386 INFO L226 Difference]: Without dead ends: 37 [2024-09-11 19:17:16,386 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2024-09-11 19:17:16,387 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:16,387 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 65 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:17:16,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-11 19:17:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-09-11 19:17:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-11 19:17:16,393 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 30 [2024-09-11 19:17:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:16,393 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-11 19:17:16,393 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:16,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-11 19:17:16,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-11 19:17:16,394 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:16,394 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:16,406 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-11 19:17:16,595 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-11 19:17:16,595 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:16,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash 439389136, now seen corresponding path program 2 times [2024-09-11 19:17:16,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:16,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107714501] [2024-09-11 19:17:16,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:16,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-11 19:17:16,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:16,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107714501] [2024-09-11 19:17:16,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107714501] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:17:16,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036273530] [2024-09-11 19:17:16,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:17:16,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:16,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:16,671 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-11 19:17:16,673 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-11 19:17:16,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:17:16,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:17:16,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:17:16,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:17:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-11 19:17:16,807 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:17:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-11 19:17:16,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036273530] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:17:16,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:17:16,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-09-11 19:17:16,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426604484] [2024-09-11 19:17:16,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:17:16,851 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:17:16,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:16,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:17:16,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:17:16,852 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:16,917 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2024-09-11 19:17:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:17:16,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-09-11 19:17:16,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:16,918 INFO L225 Difference]: With dead ends: 60 [2024-09-11 19:17:16,919 INFO L226 Difference]: Without dead ends: 44 [2024-09-11 19:17:16,919 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:17:16,919 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:16,919 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:17:16,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-11 19:17:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-09-11 19:17:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-09-11 19:17:16,927 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 33 [2024-09-11 19:17:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:16,927 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-09-11 19:17:16,927 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:16,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-09-11 19:17:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-11 19:17:16,929 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:16,929 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:16,942 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 19:17:17,129 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:17,129 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:17,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:17,130 INFO L85 PathProgramCache]: Analyzing trace with hash 538648239, now seen corresponding path program 3 times [2024-09-11 19:17:17,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:17,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150228302] [2024-09-11 19:17:17,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:17,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-11 19:17:17,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:17,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150228302] [2024-09-11 19:17:17,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150228302] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:17:17,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467797243] [2024-09-11 19:17:17,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:17:17,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:17,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:17,241 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-11 19:17:17,242 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-11 19:17:17,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-11 19:17:17,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:17:17,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:17:17,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:17:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-09-11 19:17:17,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:17:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-09-11 19:17:17,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467797243] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:17:17,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:17:17,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2024-09-11 19:17:17,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635274196] [2024-09-11 19:17:17,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:17:17,490 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-11 19:17:17,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:17,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-11 19:17:17,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-09-11 19:17:17,491 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:17,982 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2024-09-11 19:17:17,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-11 19:17:17,982 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-09-11 19:17:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:17,984 INFO L225 Difference]: With dead ends: 157 [2024-09-11 19:17:17,985 INFO L226 Difference]: Without dead ends: 132 [2024-09-11 19:17:17,986 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=560, Invalid=1080, Unknown=0, NotChecked=0, Total=1640 [2024-09-11 19:17:17,986 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 374 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:17,986 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 40 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:17:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-09-11 19:17:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 103. [2024-09-11 19:17:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 102 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions. [2024-09-11 19:17:18,009 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 42 [2024-09-11 19:17:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:18,011 INFO L474 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions. [2024-09-11 19:17:18,011 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:18,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2024-09-11 19:17:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-09-11 19:17:18,013 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:18,013 INFO L216 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:18,027 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 19:17:18,213 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-11 19:17:18,214 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:18,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1078809925, now seen corresponding path program 4 times [2024-09-11 19:17:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:18,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770389034] [2024-09-11 19:17:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 262 proven. 35 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-09-11 19:17:18,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:18,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770389034] [2024-09-11 19:17:18,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770389034] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:17:18,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110307812] [2024-09-11 19:17:18,492 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 19:17:18,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:18,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:18,495 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-11 19:17:18,499 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-11 19:17:18,640 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 19:17:18,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:17:18,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 19:17:18,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:17:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 26 proven. 227 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-09-11 19:17:18,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:17:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 26 proven. 227 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-09-11 19:17:18,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110307812] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:17:18,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:17:18,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 24 [2024-09-11 19:17:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907004449] [2024-09-11 19:17:18,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:17:18,996 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-11 19:17:18,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-11 19:17:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2024-09-11 19:17:18,998 INFO L87 Difference]: Start difference. First operand 103 states and 131 transitions. Second operand has 24 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 24 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:19,942 INFO L93 Difference]: Finished difference Result 272 states and 366 transitions. [2024-09-11 19:17:19,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-09-11 19:17:19,942 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 24 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-09-11 19:17:19,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:19,943 INFO L225 Difference]: With dead ends: 272 [2024-09-11 19:17:19,943 INFO L226 Difference]: Without dead ends: 204 [2024-09-11 19:17:19,947 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 189 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1347, Invalid=4659, Unknown=0, NotChecked=0, Total=6006 [2024-09-11 19:17:19,948 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 923 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:19,948 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 106 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:17:19,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-09-11 19:17:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 123. [2024-09-11 19:17:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 122 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 155 transitions. [2024-09-11 19:17:19,975 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 155 transitions. Word has length 101 [2024-09-11 19:17:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:19,975 INFO L474 AbstractCegarLoop]: Abstraction has 123 states and 155 transitions. [2024-09-11 19:17:19,975 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 24 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:19,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2024-09-11 19:17:19,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-09-11 19:17:19,979 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:19,979 INFO L216 NwaCegarLoop]: trace histogram [24, 24, 24, 6, 6, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:19,993 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 19:17:20,183 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-11 19:17:20,184 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:20,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:20,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1691455241, now seen corresponding path program 5 times [2024-09-11 19:17:20,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:20,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178564369] [2024-09-11 19:17:20,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:20,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 367 proven. 51 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2024-09-11 19:17:20,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:20,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178564369] [2024-09-11 19:17:20,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178564369] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:17:20,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920848862] [2024-09-11 19:17:20,460 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-11 19:17:20,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:20,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:20,461 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:17:20,462 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-11 19:17:49,503 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2024-09-11 19:17:49,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:17:49,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 19:17:49,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:17:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 614 proven. 51 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-09-11 19:17:49,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:17:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 493 proven. 172 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-09-11 19:17:49,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920848862] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:17:49,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:17:49,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-09-11 19:17:49,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22958336] [2024-09-11 19:17:49,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:17:49,836 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-11 19:17:49,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:49,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-11 19:17:49,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2024-09-11 19:17:49,837 INFO L87 Difference]: Start difference. First operand 123 states and 155 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 24 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:50,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:50,036 INFO L93 Difference]: Finished difference Result 304 states and 423 transitions. [2024-09-11 19:17:50,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-11 19:17:50,036 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 24 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-09-11 19:17:50,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:50,037 INFO L225 Difference]: With dead ends: 304 [2024-09-11 19:17:50,038 INFO L226 Difference]: Without dead ends: 219 [2024-09-11 19:17:50,041 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2024-09-11 19:17:50,042 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 64 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:50,042 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 65 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:17:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-09-11 19:17:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-09-11 19:17:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.298165137614679) internal successors, (283), 218 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 283 transitions. [2024-09-11 19:17:50,081 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 283 transitions. Word has length 121 [2024-09-11 19:17:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:50,082 INFO L474 AbstractCegarLoop]: Abstraction has 219 states and 283 transitions. [2024-09-11 19:17:50,082 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 24 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:50,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 283 transitions. [2024-09-11 19:17:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-09-11 19:17:50,088 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:50,088 INFO L216 NwaCegarLoop]: trace histogram [56, 56, 56, 6, 6, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:50,114 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-11 19:17:50,288 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:50,289 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:50,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash 855553271, now seen corresponding path program 6 times [2024-09-11 19:17:50,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:50,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477216426] [2024-09-11 19:17:50,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:50,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4937 backedges. 1855 proven. 287 refuted. 0 times theorem prover too weak. 2795 trivial. 0 not checked. [2024-09-11 19:17:50,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477216426] [2024-09-11 19:17:50,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477216426] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:17:50,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901011293] [2024-09-11 19:17:50,975 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-11 19:17:50,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:50,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:50,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:17:50,977 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-11 19:17:52,432 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-09-11 19:17:52,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:17:52,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 19:17:52,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:17:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4937 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4901 trivial. 0 not checked. [2024-09-11 19:17:52,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:17:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4937 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4901 trivial. 0 not checked. [2024-09-11 19:17:52,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901011293] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:17:52,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:17:52,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 32 [2024-09-11 19:17:52,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670542916] [2024-09-11 19:17:52,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:17:52,979 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-11 19:17:52,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-11 19:17:52,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=780, Unknown=0, NotChecked=0, Total=1056 [2024-09-11 19:17:52,980 INFO L87 Difference]: Start difference. First operand 219 states and 283 transitions. Second operand has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 32 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:18:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:18:00,336 INFO L93 Difference]: Finished difference Result 990 states and 1338 transitions. [2024-09-11 19:18:00,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2024-09-11 19:18:00,337 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 32 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2024-09-11 19:18:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:18:00,342 INFO L225 Difference]: With dead ends: 990 [2024-09-11 19:18:00,342 INFO L226 Difference]: Without dead ends: 833 [2024-09-11 19:18:00,351 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26616 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=19974, Invalid=49458, Unknown=0, NotChecked=0, Total=69432 [2024-09-11 19:18:00,351 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 3425 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3425 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:18:00,352 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3425 Valid, 76 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:18:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2024-09-11 19:18:00,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 247. [2024-09-11 19:18:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.2804878048780488) internal successors, (315), 246 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:18:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 315 transitions. [2024-09-11 19:18:00,408 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 315 transitions. Word has length 217 [2024-09-11 19:18:00,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:18:00,408 INFO L474 AbstractCegarLoop]: Abstraction has 247 states and 315 transitions. [2024-09-11 19:18:00,409 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 32 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:18:00,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:18:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 315 transitions. [2024-09-11 19:18:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-09-11 19:18:00,410 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:18:00,411 INFO L216 NwaCegarLoop]: trace histogram [60, 60, 60, 14, 14, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:18:00,428 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-11 19:18:00,611 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:18:00,611 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:18:00,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:18:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1628110019, now seen corresponding path program 7 times [2024-09-11 19:18:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:18:00,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708308947] [2024-09-11 19:18:00,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:18:00,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:18:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:18:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 2122 proven. 330 refuted. 0 times theorem prover too weak. 3351 trivial. 0 not checked. [2024-09-11 19:18:01,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:18:01,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708308947] [2024-09-11 19:18:01,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708308947] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:18:01,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079558046] [2024-09-11 19:18:01,310 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-11 19:18:01,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:18:01,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:18:01,311 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:18:01,312 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-11 19:18:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:18:01,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-11 19:18:01,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:18:01,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 2122 proven. 330 refuted. 0 times theorem prover too weak. 3351 trivial. 0 not checked. [2024-09-11 19:18:01,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:18:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 2122 proven. 330 refuted. 0 times theorem prover too weak. 3351 trivial. 0 not checked. [2024-09-11 19:18:02,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079558046] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:18:02,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:18:02,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 39 [2024-09-11 19:18:02,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325769157] [2024-09-11 19:18:02,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:18:02,114 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-09-11 19:18:02,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:18:02,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-09-11 19:18:02,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=923, Unknown=0, NotChecked=0, Total=1560 [2024-09-11 19:18:02,115 INFO L87 Difference]: Start difference. First operand 247 states and 315 transitions. Second operand has 40 states, 40 states have (on average 3.425) internal successors, (137), 39 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:18:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:18:02,319 INFO L93 Difference]: Finished difference Result 489 states and 647 transitions. [2024-09-11 19:18:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-11 19:18:02,320 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.425) internal successors, (137), 39 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 245 [2024-09-11 19:18:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:18:02,321 INFO L225 Difference]: With dead ends: 489 [2024-09-11 19:18:02,321 INFO L226 Difference]: Without dead ends: 307 [2024-09-11 19:18:02,322 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 456 SyntacticMatches, 12 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=737, Invalid=1155, Unknown=0, NotChecked=0, Total=1892 [2024-09-11 19:18:02,322 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 91 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:18:02,322 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 124 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:18:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-09-11 19:18:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-09-11 19:18:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.2908496732026145) internal successors, (395), 306 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:18:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 395 transitions. [2024-09-11 19:18:02,372 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 395 transitions. Word has length 245 [2024-09-11 19:18:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:18:02,372 INFO L474 AbstractCegarLoop]: Abstraction has 307 states and 395 transitions. [2024-09-11 19:18:02,372 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.425) internal successors, (137), 39 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:18:02,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:18:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 395 transitions. [2024-09-11 19:18:02,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-09-11 19:18:02,374 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:18:02,375 INFO L216 NwaCegarLoop]: trace histogram [80, 80, 80, 14, 14, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:18:02,389 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-11 19:18:02,578 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-11 19:18:02,578 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:18:02,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:18:02,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1561023321, now seen corresponding path program 8 times [2024-09-11 19:18:02,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:18:02,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438434490] [2024-09-11 19:18:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:18:02,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:18:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:18:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10053 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 2591 trivial. 0 not checked. [2024-09-11 19:18:03,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:18:03,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438434490] [2024-09-11 19:18:03,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438434490] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:18:03,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8820451] [2024-09-11 19:18:03,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:18:03,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:18:03,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:18:03,118 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:18:03,119 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-11 19:18:03,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:18:03,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:18:03,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 1913 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 19:18:03,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:18:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10053 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 2591 trivial. 0 not checked. [2024-09-11 19:18:04,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:18:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10053 backedges. 0 proven. 7462 refuted. 0 times theorem prover too weak. 2591 trivial. 0 not checked. [2024-09-11 19:18:04,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8820451] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:18:04,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:18:04,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-09-11 19:18:04,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870531346] [2024-09-11 19:18:04,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:18:04,434 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 19:18:04,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:18:04,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 19:18:04,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2024-09-11 19:18:04,435 INFO L87 Difference]: Start difference. First operand 307 states and 395 transitions. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:18:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:18:04,594 INFO L93 Difference]: Finished difference Result 427 states and 538 transitions. [2024-09-11 19:18:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:18:04,594 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 305 [2024-09-11 19:18:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:18:04,597 INFO L225 Difference]: With dead ends: 427 [2024-09-11 19:18:04,597 INFO L226 Difference]: Without dead ends: 391 [2024-09-11 19:18:04,597 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 598 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2024-09-11 19:18:04,598 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 141 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:18:04,598 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 60 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:18:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-09-11 19:18:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 370. [2024-09-11 19:18:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 1.2981029810298104) internal successors, (479), 369 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:18:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 479 transitions. [2024-09-11 19:18:04,679 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 479 transitions. Word has length 305 [2024-09-11 19:18:04,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:18:04,680 INFO L474 AbstractCegarLoop]: Abstraction has 370 states and 479 transitions. [2024-09-11 19:18:04,680 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:18:04,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:18:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 479 transitions. [2024-09-11 19:18:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-09-11 19:18:04,684 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:18:04,684 INFO L216 NwaCegarLoop]: trace histogram [100, 100, 100, 14, 14, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:18:04,702 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-11 19:18:04,888 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-11 19:18:04,888 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:18:04,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:18:04,889 INFO L85 PathProgramCache]: Analyzing trace with hash 726149133, now seen corresponding path program 9 times [2024-09-11 19:18:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:18:04,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230771468] [2024-09-11 19:18:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:18:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:18:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:18:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 15616 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 15420 trivial. 0 not checked. [2024-09-11 19:18:05,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:18:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230771468] [2024-09-11 19:18:05,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230771468] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:18:05,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777694542] [2024-09-11 19:18:05,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:18:05,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:18:05,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:18:05,878 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:18:05,879 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-11 19:18:06,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-09-11 19:18:06,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:18:06,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-09-11 19:18:06,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:18:06,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 19:18:06,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-11 19:18:06,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:18:06,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2024-09-11 19:18:06,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-09-11 19:18:06,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:18:06,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-09-11 19:18:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15616 backedges. 506 proven. 37 refuted. 0 times theorem prover too weak. 15073 trivial. 0 not checked. [2024-09-11 19:18:07,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:18:59,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2024-09-11 19:18:59,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:18:59,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 323610 treesize of output 299054 [2024-09-11 19:19:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 15616 backedges. 506 proven. 37 refuted. 0 times theorem prover too weak. 15073 trivial. 0 not checked. [2024-09-11 19:19:01,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777694542] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:19:01,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:19:01,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 13] total 40 [2024-09-11 19:19:01,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915353519] [2024-09-11 19:19:01,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:19:01,634 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-11 19:19:01,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:19:01,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-11 19:19:01,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1427, Unknown=3, NotChecked=0, Total=1640 [2024-09-11 19:19:01,636 INFO L87 Difference]: Start difference. First operand 370 states and 479 transitions. Second operand has 41 states, 41 states have (on average 2.6097560975609757) internal successors, (107), 40 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:19:06,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:19:10,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:19:37,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:20:23,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:20:27,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:20:31,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:20:35,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:21:04,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:21:08,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:21:12,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:21:16,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:21:17,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]