./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/hard-ll_valuebound2.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c ../results/automizer-verification-files/SV-COMP24_unreach-call/hard-ll_valuebound2.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 05:48:20,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 05:48:20,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 05:48:20,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 05:48:20,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 05:48:20,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 05:48:20,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 05:48:20,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 05:48:20,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 05:48:20,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 05:48:20,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 05:48:20,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 05:48:20,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 05:48:20,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 05:48:20,378 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 05:48:20,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 05:48:20,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 05:48:20,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 05:48:20,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 05:48:20,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 05:48:20,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 05:48:20,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 05:48:20,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 05:48:20,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 05:48:20,382 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 05:48:20,383 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 05:48:20,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 05:48:20,383 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 05:48:20,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 05:48:20,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 05:48:20,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 05:48:20,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 05:48:20,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:48:20,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 05:48:20,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 05:48:20,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 05:48:20,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 05:48:20,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 05:48:20,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 05:48:20,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 05:48:20,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 05:48:20,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 05:48:20,387 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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 05:48:20,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 05:48:20,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 05:48:20,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 05:48:20,575 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 05:48:20,575 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 05:48:20,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/hard-ll_valuebound2.yml/witness-2.1.yml [2024-09-13 05:48:20,637 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 05:48:20,637 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 05:48:20,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2024-09-13 05:48:21,889 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 05:48:22,071 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 05:48:22,072 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2024-09-13 05:48:22,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/61ed7d991/596034fbd6e74565aa7e194a69733783/FLAGca594bf41 [2024-09-13 05:48:22,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/61ed7d991/596034fbd6e74565aa7e194a69733783 [2024-09-13 05:48:22,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 05:48:22,479 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 05:48:22,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 05:48:22,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 05:48:22,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 05:48:22,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:48:20" (1/2) ... [2024-09-13 05:48:22,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b86e8b and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:48:22, skipping insertion in model container [2024-09-13 05:48:22,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:48:20" (1/2) ... [2024-09-13 05:48:22,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@549dd0e0 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:48:22, skipping insertion in model container [2024-09-13 05:48:22,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:48:22" (2/2) ... [2024-09-13 05:48:22,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b86e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22, skipping insertion in model container [2024-09-13 05:48:22,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:48:22" (2/2) ... [2024-09-13 05:48:22,499 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 05:48:22,499 INFO L1541 ArrayList]: Loop invariant at [L36-L44] (((((((((A % 4294967296) == r) && ((d + ((B / 4294967296) * 4294967296)) == B)) && (q == 0)) && (1 <= d)) && ((A % 4294967296) <= 2)) && (p == 1)) || ((((((((A % 4294967296) == r) && (d == ((long long) 2 * (B % 4294967296)))) && (p == 2)) && (q == 0)) && (1 <= d)) && ((A % 4294967296) <= 2)) && ((B % 4294967296) <= r))) || (((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((A % 4294967296) + d) == (((long long) (B % 4294967296) * 4) + r))) && (q == 0)) && (p == 4)) && (((A % 4294967296) + (d / 2)) == (r + ((long long) 2 * (B % 4294967296))))) && (1 <= d)) && ((A % 4294967296) <= 2))) [2024-09-13 05:48:22,500 INFO L1541 ArrayList]: Loop invariant at [L46-L58] ((((((((((((0 <= r) && (((__int128) r + 1) <= d)) && ((d + r) == (A % 4294967296))) && ((r + ((long long) 2 * (B % 4294967296))) == ((A % 4294967296) + d))) && (q == 1)) && ((A % 4294967296) <= 2)) && (p == 1)) || ((((((r == 0) && (q == 2)) && (p == 2)) && ((((B / 4294967296) * 4294967296) + 1) == B)) && ((A % 4294967296) == 2)) && (d == 2))) || ((((((((A % 4294967296) == r) && (d == ((long long) 2 * (B % 4294967296)))) && (((__int128) r + 1) <= d)) && (p == 2)) && (q == 0)) && ((A % 4294967296) <= 2)) && ((B % 4294967296) <= r))) || (((((((B % 4294967296) == 1) && (r == 0)) && (q == 2)) && ((A % 4294967296) == 2)) && (d == 1)) && (p == 1))) || (((((A % 4294967296) == r) && ((d + ((B / 4294967296) * 4294967296)) == B)) && (q == 0)) && (p == 1))) || (((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((A % 4294967296) + d) == (((long long) (B % 4294967296) * 4) + r))) && (q == 0)) && (p == 4)) && (((A % 4294967296) + (d / 2)) == (r + ((long long) 2 * (B % 4294967296))))) && (1 <= d)) && ((A % 4294967296) <= 2))) [2024-09-13 05:48:22,500 INFO L1541 ArrayList]: Function contract at [L14]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-13 05:48:22,500 INFO L1541 ArrayList]: Function contract at [L11]: requires null, ensures (\old(cond) != 0) [2024-09-13 05:48:22,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 05:48:22,658 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] [2024-09-13 05:48:22,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:48:22,692 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 05:48:22,726 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] Start Parsing Local Start Parsing Local [2024-09-13 05:48:22,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:48:22,791 INFO L204 MainTranslator]: Completed translation [2024-09-13 05:48:22,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22 WrapperNode [2024-09-13 05:48:22,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 05:48:22,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 05:48:22,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 05:48:22,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 05:48:22,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (1/1) ... [2024-09-13 05:48:22,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (1/1) ... [2024-09-13 05:48:22,857 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-13 05:48:22,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 05:48:22,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 05:48:22,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 05:48:22,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 05:48:22,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (1/1) ... [2024-09-13 05:48:22,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (1/1) ... [2024-09-13 05:48:22,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (1/1) ... [2024-09-13 05:48:22,878 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 05:48:22,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (1/1) ... [2024-09-13 05:48:22,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (1/1) ... [2024-09-13 05:48:22,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (1/1) ... [2024-09-13 05:48:22,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (1/1) ... [2024-09-13 05:48:22,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (1/1) ... [2024-09-13 05:48:22,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (1/1) ... [2024-09-13 05:48:22,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 05:48:22,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 05:48:22,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 05:48:22,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 05:48:22,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (1/1) ... [2024-09-13 05:48:22,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:48:22,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:22,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 05:48:22,943 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 05:48:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 05:48:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 05:48:22,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 05:48:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 05:48:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 05:48:22,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 05:48:22,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 05:48:22,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 05:48:23,041 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 05:48:23,043 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 05:48:23,345 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:48:23,369 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-09-13 05:48:23,370 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 05:48:23,393 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 05:48:23,393 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 05:48:23,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:48:23 BoogieIcfgContainer [2024-09-13 05:48:23,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 05:48:23,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 05:48:23,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 05:48:23,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 05:48:23,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:48:20" (1/4) ... [2024-09-13 05:48:23,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e27c55 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:48:23, skipping insertion in model container [2024-09-13 05:48:23,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 05:48:22" (2/4) ... [2024-09-13 05:48:23,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e27c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:48:23, skipping insertion in model container [2024-09-13 05:48:23,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:48:22" (3/4) ... [2024-09-13 05:48:23,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e27c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:48:23, skipping insertion in model container [2024-09-13 05:48:23,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:48:23" (4/4) ... [2024-09-13 05:48:23,405 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound2.c [2024-09-13 05:48:23,418 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 05:48:23,419 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-13 05:48:23,454 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 05:48:23,461 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=None, 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;@4bdba10b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 05:48:23,461 INFO L337 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-09-13 05:48:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 05:48:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 05:48:23,472 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:23,472 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 05:48:23,473 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:23,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:23,480 INFO L85 PathProgramCache]: Analyzing trace with hash 134843102, now seen corresponding path program 1 times [2024-09-13 05:48:23,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:23,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815077186] [2024-09-13 05:48:23,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:23,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:23,579 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-13 05:48:23,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:23,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815077186] [2024-09-13 05:48:23,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815077186] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:48:23,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:48:23,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:48:23,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443295123] [2024-09-13 05:48:23,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:48:23,585 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 05:48:23,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:23,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 05:48:23,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 05:48:23,605 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:48:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:23,642 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-09-13 05:48:23,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 05:48:23,665 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 05:48:23,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:23,670 INFO L225 Difference]: With dead ends: 43 [2024-09-13 05:48:23,670 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 05:48:23,671 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-13 05:48:23,678 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:23,678 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:48:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 05:48:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-13 05:48:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 29 states have internal predecessors, (32), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 05:48:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2024-09-13 05:48:23,705 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 5 [2024-09-13 05:48:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:23,705 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-09-13 05:48:23,705 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:48:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-09-13 05:48:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 05:48:23,706 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:23,706 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 05:48:23,706 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 05:48:23,706 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:23,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:23,707 INFO L85 PathProgramCache]: Analyzing trace with hash 134843164, now seen corresponding path program 1 times [2024-09-13 05:48:23,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:23,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832317294] [2024-09-13 05:48:23,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:23,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:23,754 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-13 05:48:23,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:23,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832317294] [2024-09-13 05:48:23,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832317294] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:48:23,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:48:23,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:48:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398942285] [2024-09-13 05:48:23,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:48:23,757 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:48:23,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:23,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:48:23,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:48:23,760 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:48:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:23,788 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-09-13 05:48:23,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:48:23,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 05:48:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:23,789 INFO L225 Difference]: With dead ends: 40 [2024-09-13 05:48:23,789 INFO L226 Difference]: Without dead ends: 40 [2024-09-13 05:48:23,789 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:48:23,790 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:23,791 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:48:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-13 05:48:23,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-13 05:48:23,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 05:48:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-09-13 05:48:23,795 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 5 [2024-09-13 05:48:23,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:23,795 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-09-13 05:48:23,795 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:48:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-09-13 05:48:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 05:48:23,796 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:23,796 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:23,796 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 05:48:23,797 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:23,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash 363565673, now seen corresponding path program 1 times [2024-09-13 05:48:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348867015] [2024-09-13 05:48:23,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:23,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,180 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 05:48:24,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348867015] [2024-09-13 05:48:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348867015] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:24,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316028450] [2024-09-13 05:48:24,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:24,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:24,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:24,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:48:24,257 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 05:48:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-13 05:48:24,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 05:48:24,464 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:48:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316028450] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:48:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 05:48:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2024-09-13 05:48:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666878441] [2024-09-13 05:48:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:48:24,467 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 05:48:24,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:24,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 05:48:24,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-13 05:48:24,468 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 7 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 05:48:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:24,615 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-13 05:48:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 05:48:24,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-09-13 05:48:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:24,616 INFO L225 Difference]: With dead ends: 51 [2024-09-13 05:48:24,616 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 05:48:24,616 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-13 05:48:24,617 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:24,617 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 95 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:48:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 05:48:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 05:48:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 34 states have internal predecessors, (38), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 05:48:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-09-13 05:48:24,627 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 19 [2024-09-13 05:48:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:24,629 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-09-13 05:48:24,630 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 05:48:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-09-13 05:48:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 05:48:24,631 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:24,631 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:24,643 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 05:48:24,835 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:24,836 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:24,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:24,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960997, now seen corresponding path program 1 times [2024-09-13 05:48:24,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:24,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943294992] [2024-09-13 05:48:24,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:24,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,879 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 05:48:24,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:24,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943294992] [2024-09-13 05:48:24,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943294992] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:48:24,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:48:24,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:48:24,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916258225] [2024-09-13 05:48:24,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:48:24,884 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:48:24,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:24,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:48:24,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:48:24,885 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:48:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:24,893 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-09-13 05:48:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:48:24,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 05:48:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:24,896 INFO L225 Difference]: With dead ends: 49 [2024-09-13 05:48:24,896 INFO L226 Difference]: Without dead ends: 49 [2024-09-13 05:48:24,896 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-13 05:48:24,897 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:24,897 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:48:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-13 05:48:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-13 05:48:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 05:48:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-09-13 05:48:24,905 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 24 [2024-09-13 05:48:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:24,905 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-09-13 05:48:24,905 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:48:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-09-13 05:48:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 05:48:24,905 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:24,905 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:24,906 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 05:48:24,906 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:24,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:24,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960836, now seen corresponding path program 1 times [2024-09-13 05:48:24,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:24,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039944250] [2024-09-13 05:48:24,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:24,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,937 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 05:48:24,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:24,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039944250] [2024-09-13 05:48:24,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039944250] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:48:24,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:48:24,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:48:24,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674051736] [2024-09-13 05:48:24,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:48:24,942 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:48:24,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:24,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:48:24,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:48:24,942 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:48:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:24,973 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-09-13 05:48:24,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:48:24,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 05:48:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:24,974 INFO L225 Difference]: With dead ends: 48 [2024-09-13 05:48:24,974 INFO L226 Difference]: Without dead ends: 48 [2024-09-13 05:48:24,974 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-13 05:48:24,974 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 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-13 05:48:24,975 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:48:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-13 05:48:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-09-13 05:48:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 05:48:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2024-09-13 05:48:24,988 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 24 [2024-09-13 05:48:24,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:24,988 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2024-09-13 05:48:24,989 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:48:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2024-09-13 05:48:24,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 05:48:24,989 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:24,989 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:24,989 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 05:48:24,989 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:24,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1154352905, now seen corresponding path program 1 times [2024-09-13 05:48:24,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:24,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167701229] [2024-09-13 05:48:24,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:25,272 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:25,275 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:25,278 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:25,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:48:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:25,290 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:48:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:25,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:48:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:48:25,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:25,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167701229] [2024-09-13 05:48:25,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167701229] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:25,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623439265] [2024-09-13 05:48:25,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:25,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:25,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:25,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:48:25,320 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 05:48:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:25,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 05:48:25,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:48:25,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:48:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:48:25,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623439265] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:48:25,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:48:25,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-09-13 05:48:25,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789955893] [2024-09-13 05:48:25,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:48:25,938 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 05:48:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:25,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 05:48:25,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:48:25,938 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-13 05:48:26,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:26,164 INFO L93 Difference]: Finished difference Result 73 states and 106 transitions. [2024-09-13 05:48:26,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 05:48:26,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 37 [2024-09-13 05:48:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:26,165 INFO L225 Difference]: With dead ends: 73 [2024-09-13 05:48:26,165 INFO L226 Difference]: Without dead ends: 73 [2024-09-13 05:48:26,165 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-13 05:48:26,166 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:26,166 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 113 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:48:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-13 05:48:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2024-09-13 05:48:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-13 05:48:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2024-09-13 05:48:26,176 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 37 [2024-09-13 05:48:26,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:26,176 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2024-09-13 05:48:26,176 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-13 05:48:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2024-09-13 05:48:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-13 05:48:26,177 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:26,177 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:26,189 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 05:48:26,377 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 05:48:26,378 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:26,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:26,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1515868503, now seen corresponding path program 1 times [2024-09-13 05:48:26,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:26,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286492498] [2024-09-13 05:48:26,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:26,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:48:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [108236226] [2024-09-13 05:48:26,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:26,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:26,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:26,402 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:48:26,403 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 05:48:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:26,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 05:48:26,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-13 05:48:26,506 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:48:26,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:26,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286492498] [2024-09-13 05:48:26,507 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:48:26,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108236226] [2024-09-13 05:48:26,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108236226] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:48:26,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:48:26,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:48:26,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302610277] [2024-09-13 05:48:26,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:48:26,508 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:48:26,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:26,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:48:26,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:48:26,510 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-13 05:48:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:26,539 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2024-09-13 05:48:26,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:48:26,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2024-09-13 05:48:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:26,541 INFO L225 Difference]: With dead ends: 68 [2024-09-13 05:48:26,541 INFO L226 Difference]: Without dead ends: 68 [2024-09-13 05:48:26,541 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-13 05:48:26,542 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:26,542 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 62 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:48:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-13 05:48:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2024-09-13 05:48:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 41 states have internal predecessors, (50), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 05:48:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2024-09-13 05:48:26,546 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 94 transitions. Word has length 50 [2024-09-13 05:48:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:26,546 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 94 transitions. [2024-09-13 05:48:26,546 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-13 05:48:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 94 transitions. [2024-09-13 05:48:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 05:48:26,547 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:26,547 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:26,560 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 05:48:26,748 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-13 05:48:26,748 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:26,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:26,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2018739730, now seen corresponding path program 1 times [2024-09-13 05:48:26,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:26,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887188294] [2024-09-13 05:48:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:26,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:26,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:26,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:26,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:48:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:26,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:48:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:26,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:48:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:26,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:48:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:26,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:48:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:26,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 05:48:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 05:48:26,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:26,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887188294] [2024-09-13 05:48:26,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887188294] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:48:26,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:48:26,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:48:26,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293210792] [2024-09-13 05:48:26,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:48:26,866 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:48:26,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:26,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:48:26,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:48:26,867 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-13 05:48:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:26,903 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2024-09-13 05:48:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:48:26,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2024-09-13 05:48:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:26,905 INFO L225 Difference]: With dead ends: 72 [2024-09-13 05:48:26,905 INFO L226 Difference]: Without dead ends: 65 [2024-09-13 05:48:26,905 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-13 05:48:26,906 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 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-13 05:48:26,906 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:48:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-13 05:48:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-09-13 05:48:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 05:48:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-09-13 05:48:26,910 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 55 [2024-09-13 05:48:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:26,910 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-09-13 05:48:26,910 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-13 05:48:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-09-13 05:48:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 05:48:26,911 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:26,911 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:26,912 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 05:48:26,912 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:26,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:26,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1118640133, now seen corresponding path program 2 times [2024-09-13 05:48:26,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:26,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244564147] [2024-09-13 05:48:26,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:26,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:27,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:27,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:27,346 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:27,347 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:48:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:27,352 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:48:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:27,358 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:48:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:27,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:48:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:27,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:48:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:27,379 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 05:48:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 05:48:27,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:27,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244564147] [2024-09-13 05:48:27,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244564147] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:27,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987151282] [2024-09-13 05:48:27,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 05:48:27,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:27,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:27,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:48:27,390 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 05:48:27,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 05:48:27,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:48:27,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-13 05:48:27,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 05:48:27,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:48:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 05:48:28,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987151282] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:48:28,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:48:28,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2024-09-13 05:48:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821757448] [2024-09-13 05:48:28,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:48:28,269 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 05:48:28,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:28,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 05:48:28,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-09-13 05:48:28,270 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-09-13 05:48:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:28,606 INFO L93 Difference]: Finished difference Result 87 states and 132 transitions. [2024-09-13 05:48:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 05:48:28,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 55 [2024-09-13 05:48:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:28,608 INFO L225 Difference]: With dead ends: 87 [2024-09-13 05:48:28,608 INFO L226 Difference]: Without dead ends: 87 [2024-09-13 05:48:28,608 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-09-13 05:48:28,608 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 25 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:28,609 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 217 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 05:48:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-13 05:48:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2024-09-13 05:48:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 05:48:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2024-09-13 05:48:28,621 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 55 [2024-09-13 05:48:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:28,621 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2024-09-13 05:48:28,621 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-09-13 05:48:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2024-09-13 05:48:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-13 05:48:28,623 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:28,623 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:28,641 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 05:48:28,823 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-13 05:48:28,823 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:28,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash -550970448, now seen corresponding path program 1 times [2024-09-13 05:48:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133985055] [2024-09-13 05:48:28,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:48:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:48:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,740 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:48:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:48:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:48:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,792 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 05:48:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 05:48:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 05:48:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 05:48:29,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:29,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133985055] [2024-09-13 05:48:29,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133985055] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:29,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259820947] [2024-09-13 05:48:29,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:29,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:29,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:29,846 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:48:29,847 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 05:48:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:29,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-13 05:48:29,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 05:48:30,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:48:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 05:48:31,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259820947] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:48:31,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:48:31,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-09-13 05:48:31,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689247263] [2024-09-13 05:48:31,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:48:31,255 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-13 05:48:31,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:31,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-13 05:48:31,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-09-13 05:48:31,256 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 10 states have call predecessors, (27), 10 states have call successors, (27) [2024-09-13 05:48:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:31,500 INFO L93 Difference]: Finished difference Result 83 states and 122 transitions. [2024-09-13 05:48:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 05:48:31,500 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 10 states have call predecessors, (27), 10 states have call successors, (27) Word has length 69 [2024-09-13 05:48:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:31,501 INFO L225 Difference]: With dead ends: 83 [2024-09-13 05:48:31,501 INFO L226 Difference]: Without dead ends: 83 [2024-09-13 05:48:31,502 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 147 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-09-13 05:48:31,502 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:31,502 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 216 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:48:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-13 05:48:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2024-09-13 05:48:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 46 states have internal predecessors, (51), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-13 05:48:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2024-09-13 05:48:31,506 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 69 [2024-09-13 05:48:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:31,507 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2024-09-13 05:48:31,507 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 10 states have call predecessors, (27), 10 states have call successors, (27) [2024-09-13 05:48:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-09-13 05:48:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-13 05:48:31,508 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:31,508 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:31,520 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 05:48:31,711 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-13 05:48:31,712 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:31,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:31,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1381978582, now seen corresponding path program 1 times [2024-09-13 05:48:31,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:31,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513296121] [2024-09-13 05:48:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:31,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:48:31,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [55043148] [2024-09-13 05:48:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:31,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:31,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:31,741 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:48:31,743 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-13 05:48:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:31,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 05:48:31,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-09-13 05:48:31,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:48:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-09-13 05:48:32,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513296121] [2024-09-13 05:48:32,041 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:48:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55043148] [2024-09-13 05:48:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55043148] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:48:32,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:48:32,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-09-13 05:48:32,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615765865] [2024-09-13 05:48:32,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 05:48:32,042 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 05:48:32,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:32,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 05:48:32,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:48:32,042 INFO L87 Difference]: Start difference. First operand 74 states and 103 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-13 05:48:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:32,130 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2024-09-13 05:48:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 05:48:32,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 82 [2024-09-13 05:48:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:32,131 INFO L225 Difference]: With dead ends: 82 [2024-09-13 05:48:32,131 INFO L226 Difference]: Without dead ends: 82 [2024-09-13 05:48:32,131 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:48:32,132 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:32,132 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 106 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:48:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-09-13 05:48:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2024-09-13 05:48:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-13 05:48:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2024-09-13 05:48:32,138 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 82 [2024-09-13 05:48:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:32,139 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2024-09-13 05:48:32,139 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-13 05:48:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2024-09-13 05:48:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-13 05:48:32,140 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:32,140 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:32,152 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-13 05:48:32,344 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-13 05:48:32,345 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:32,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:32,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1551961905, now seen corresponding path program 1 times [2024-09-13 05:48:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:32,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658092153] [2024-09-13 05:48:32,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:32,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:48:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:48:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,596 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:48:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:48:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,603 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:48:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 05:48:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 05:48:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 05:48:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-13 05:48:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-13 05:48:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 05:48:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 05:48:32,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:32,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658092153] [2024-09-13 05:48:32,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658092153] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:32,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573118226] [2024-09-13 05:48:32,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:32,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:32,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:32,635 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-13 05:48:32,636 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-13 05:48:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:32,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-13 05:48:32,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-09-13 05:48:32,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:48:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-09-13 05:48:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573118226] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:33,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:48:33,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 10 [2024-09-13 05:48:33,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485481132] [2024-09-13 05:48:33,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:48:33,054 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:48:33,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:33,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:48:33,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-09-13 05:48:33,055 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-13 05:48:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:33,099 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2024-09-13 05:48:33,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:48:33,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 87 [2024-09-13 05:48:33,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:33,100 INFO L225 Difference]: With dead ends: 66 [2024-09-13 05:48:33,100 INFO L226 Difference]: Without dead ends: 53 [2024-09-13 05:48:33,100 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-09-13 05:48:33,100 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:33,100 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 49 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:48:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-13 05:48:33,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-13 05:48:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 05:48:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2024-09-13 05:48:33,103 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 87 [2024-09-13 05:48:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:33,107 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2024-09-13 05:48:33,108 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-13 05:48:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2024-09-13 05:48:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-13 05:48:33,111 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:33,111 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:33,124 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-13 05:48:33,311 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-13 05:48:33,312 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:33,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1137425730, now seen corresponding path program 2 times [2024-09-13 05:48:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:33,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735413457] [2024-09-13 05:48:33,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,570 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,570 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:48:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:48:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:48:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:48:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:48:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 05:48:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 05:48:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,662 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 05:48:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,671 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 05:48:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 05:48:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 05:48:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 05:48:34,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:34,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735413457] [2024-09-13 05:48:34,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735413457] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:34,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296381548] [2024-09-13 05:48:34,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 05:48:34,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:34,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:34,718 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-13 05:48:34,719 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-13 05:48:34,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 05:48:34,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:48:34,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-13 05:48:34,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 05:48:35,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:48:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 05:48:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296381548] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:48:37,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:48:37,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 20 [2024-09-13 05:48:37,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023633763] [2024-09-13 05:48:37,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:48:37,494 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 05:48:37,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:37,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 05:48:37,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-09-13 05:48:37,495 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 10 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) [2024-09-13 05:48:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:37,846 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2024-09-13 05:48:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 05:48:37,846 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 10 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) Word has length 87 [2024-09-13 05:48:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:37,847 INFO L225 Difference]: With dead ends: 52 [2024-09-13 05:48:37,847 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 05:48:37,847 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2024-09-13 05:48:37,847 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 21 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:37,847 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 243 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:48:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 05:48:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 05:48:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-13 05:48:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2024-09-13 05:48:37,850 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 87 [2024-09-13 05:48:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:37,850 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-09-13 05:48:37,851 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 10 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 10 states have call predecessors, (36), 10 states have call successors, (36) [2024-09-13 05:48:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2024-09-13 05:48:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-09-13 05:48:37,851 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:48:37,851 INFO L216 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:37,865 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-13 05:48:38,055 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-13 05:48:38,056 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 05:48:38,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:48:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash -436202355, now seen corresponding path program 1 times [2024-09-13 05:48:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:48:38,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786504222] [2024-09-13 05:48:38,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:38,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:48:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:38,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:48:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:38,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:48:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:38,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:48:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:38,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 05:48:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:38,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:48:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:38,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:48:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:38,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 05:48:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:38,999 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-13 05:48:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:39,005 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-13 05:48:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:39,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-13 05:48:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:39,021 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-09-13 05:48:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:39,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 05:48:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:39,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 05:48:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:39,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 05:48:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:39,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-09-13 05:48:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:39,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 05:48:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-09-13 05:48:39,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:48:39,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786504222] [2024-09-13 05:48:39,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786504222] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:39,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328227655] [2024-09-13 05:48:39,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:48:39,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:48:39,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:48:39,093 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-13 05:48:39,094 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-13 05:48:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:48:39,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-13 05:48:39,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:48:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-09-13 05:48:39,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:48:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-09-13 05:48:40,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328227655] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 05:48:40,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:48:40,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 10] total 20 [2024-09-13 05:48:40,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365948630] [2024-09-13 05:48:40,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:48:40,363 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:48:40,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:48:40,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:48:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-09-13 05:48:40,364 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 05:48:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:48:40,405 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2024-09-13 05:48:40,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:48:40,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2024-09-13 05:48:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:48:40,406 INFO L225 Difference]: With dead ends: 48 [2024-09-13 05:48:40,406 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 05:48:40,406 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 219 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-09-13 05:48:40,407 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:48:40,407 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:48:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 05:48:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 05:48:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:48:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 05:48:40,407 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2024-09-13 05:48:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:48:40,407 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 05:48:40,408 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 05:48:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 05:48:40,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 05:48:40,410 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 12 remaining) [2024-09-13 05:48:40,410 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (10 of 12 remaining) [2024-09-13 05:48:40,411 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (9 of 12 remaining) [2024-09-13 05:48:40,411 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (8 of 12 remaining) [2024-09-13 05:48:40,411 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 12 remaining) [2024-09-13 05:48:40,411 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (6 of 12 remaining) [2024-09-13 05:48:40,411 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (5 of 12 remaining) [2024-09-13 05:48:40,411 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (4 of 12 remaining) [2024-09-13 05:48:40,411 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (3 of 12 remaining) [2024-09-13 05:48:40,411 INFO L785 garLoopResultBuilder]: Registering result SAFE for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 12 remaining) [2024-09-13 05:48:40,412 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-09-13 05:48:40,412 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 12 remaining) [2024-09-13 05:48:40,424 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-13 05:48:40,615 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-13 05:48:40,618 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:48:40,620 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 05:48:40,621 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-13 05:48:40,621 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-13 05:48:40,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 05:48:40 BoogieIcfgContainer [2024-09-13 05:48:40,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 05:48:40,622 INFO L158 Benchmark]: Toolchain (without parser) took 18142.91ms. Allocated memory was 155.2MB in the beginning and 541.1MB in the end (delta: 385.9MB). Free memory was 82.0MB in the beginning and 339.1MB in the end (delta: -257.0MB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. [2024-09-13 05:48:40,622 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:48:40,622 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:48:40,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.28ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 122.9MB in the end (delta: -41.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-09-13 05:48:40,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.54ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 122.9MB in the beginning and 183.5MB in the end (delta: -60.7MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-09-13 05:48:40,623 INFO L158 Benchmark]: Boogie Preprocessor took 43.99ms. Allocated memory is still 216.0MB. Free memory was 183.5MB in the beginning and 181.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 05:48:40,623 INFO L158 Benchmark]: RCFGBuilder took 488.85ms. Allocated memory is still 216.0MB. Free memory was 181.6MB in the beginning and 150.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-09-13 05:48:40,624 INFO L158 Benchmark]: TraceAbstraction took 17226.68ms. Allocated memory was 216.0MB in the beginning and 541.1MB in the end (delta: 325.1MB). Free memory was 150.2MB in the beginning and 339.1MB in the end (delta: -188.9MB). Peak memory consumption was 136.2MB. Max. memory is 16.1GB. [2024-09-13 05:48:40,625 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.28ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 122.9MB in the end (delta: -41.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.54ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 122.9MB in the beginning and 183.5MB in the end (delta: -60.7MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.99ms. Allocated memory is still 216.0MB. Free memory was 183.5MB in the beginning and 181.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 488.85ms. Allocated memory is still 216.0MB. Free memory was 181.6MB in the beginning and 150.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17226.68ms. Allocated memory was 216.0MB in the beginning and 541.1MB in the end (delta: 325.1MB). Free memory was 150.2MB in the beginning and 339.1MB in the end (delta: -188.9MB). Peak memory consumption was 136.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 46]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 11]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 14]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 43 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 14, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 1558 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1000 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1127 IncrementalHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 558 mSDtfsCounter, 1127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1331 GetRequests, 1212 SyntacticMatches, 21 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=10, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 63 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 1287 NumberOfCodeBlocks, 1287 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1645 ConstructedInterpolants, 0 QuantifiedInterpolants, 18699 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1384 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 3639/3818 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 05:48:40,672 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE