./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-17 19:22:15,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 19:22:15,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-17 19:22:15,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 19:22:15,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 19:22:15,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 19:22:15,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 19:22:15,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 19:22:15,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 19:22:15,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 19:22:15,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 19:22:15,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 19:22:15,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 19:22:15,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 19:22:15,919 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 19:22:15,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 19:22:15,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 19:22:15,922 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 19:22:15,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-17 19:22:15,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 19:22:15,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 19:22:15,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 19:22:15,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 19:22:15,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 19:22:15,928 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 19:22:15,928 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 19:22:15,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 19:22:15,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 19:22:15,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 19:22:15,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 19:22:15,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 19:22:15,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 19:22:15,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 19:22:15,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 19:22:15,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 19:22:15,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 19:22:15,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-17 19:22:15,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-17 19:22:15,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 19:22:15,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 19:22:15,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 19:22:15,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 19:22:15,931 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-17 19:22:16,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 19:22:16,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 19:22:16,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 19:22:16,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 19:22:16,149 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 19:22:16,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-17 19:22:17,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 19:22:17,576 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 19:22:17,576 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-17 19:22:17,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/75d613089/64794387c5fb44f2b12a5a600781de26/FLAG976b8178e [2024-09-17 19:22:17,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/75d613089/64794387c5fb44f2b12a5a600781de26 [2024-09-17 19:22:17,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 19:22:17,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 19:22:17,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 19:22:17,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 19:22:17,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 19:22:17,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aca0365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17, skipping insertion in model container [2024-09-17 19:22:17,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 19:22:17,723 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-17 19:22:17,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 19:22:17,745 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 19:22:17,753 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-17 19:22:17,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 19:22:17,785 INFO L204 MainTranslator]: Completed translation [2024-09-17 19:22:17,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17 WrapperNode [2024-09-17 19:22:17,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 19:22:17,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 19:22:17,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 19:22:17,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 19:22:17,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,801 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 19:22:17,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 19:22:17,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 19:22:17,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 19:22:17,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 19:22:17,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,824 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-17 19:22:17,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 19:22:17,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 19:22:17,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 19:22:17,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 19:22:17,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (1/1) ... [2024-09-17 19:22:17,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 19:22:17,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:22:17,870 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-17 19:22:17,873 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-17 19:22:17,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 19:22:17,960 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-17 19:22:17,960 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-17 19:22:17,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 19:22:17,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 19:22:17,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-17 19:22:17,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-17 19:22:17,960 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-17 19:22:17,960 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-17 19:22:17,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 19:22:17,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 19:22:17,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-17 19:22:17,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 19:22:17,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 19:22:17,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-17 19:22:17,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-17 19:22:17,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-17 19:22:17,962 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-17 19:22:17,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-17 19:22:17,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-17 19:22:17,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-17 19:22:18,020 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 19:22:18,021 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 19:22:18,167 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-17 19:22:18,171 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 19:22:18,189 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 19:22:18,189 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-17 19:22:18,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:22:18 BoogieIcfgContainer [2024-09-17 19:22:18,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 19:22:18,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 19:22:18,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 19:22:18,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 19:22:18,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 07:22:17" (1/3) ... [2024-09-17 19:22:18,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2375d1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 07:22:18, skipping insertion in model container [2024-09-17 19:22:18,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:17" (2/3) ... [2024-09-17 19:22:18,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2375d1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 07:22:18, skipping insertion in model container [2024-09-17 19:22:18,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:22:18" (3/3) ... [2024-09-17 19:22:18,203 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-09-17 19:22:18,216 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 19:22:18,217 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 19:22:18,271 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 19:22:18,277 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a1016b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 19:22:18,278 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 19:22:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-17 19:22:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-17 19:22:18,291 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:18,291 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:18,292 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:18,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1437097425, now seen corresponding path program 1 times [2024-09-17 19:22:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:22:18,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247545168] [2024-09-17 19:22:18,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:18,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:22:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:18,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:22:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:18,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:22:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:18,447 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:22:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:18,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 19:22:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-17 19:22:18,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:22:18,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247545168] [2024-09-17 19:22:18,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247545168] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:22:18,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:22:18,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-17 19:22:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376124291] [2024-09-17 19:22:18,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:22:18,479 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-17 19:22:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:22:18,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-17 19:22:18,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-17 19:22:18,509 INFO L87 Difference]: Start difference. First operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-17 19:22:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:18,603 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-09-17 19:22:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-17 19:22:18,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-17 19:22:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:18,610 INFO L225 Difference]: With dead ends: 78 [2024-09-17 19:22:18,610 INFO L226 Difference]: Without dead ends: 38 [2024-09-17 19:22:18,612 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-17 19:22:18,615 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:22:18,619 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 21 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 19:22:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-17 19:22:18,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-17 19:22:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-17 19:22:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-17 19:22:18,664 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-09-17 19:22:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:18,665 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-17 19:22:18,665 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-17 19:22:18,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-17 19:22:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-17 19:22:18,667 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:18,668 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:18,668 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-17 19:22:18,669 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:18,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:18,670 INFO L85 PathProgramCache]: Analyzing trace with hash 579935573, now seen corresponding path program 1 times [2024-09-17 19:22:18,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:22:18,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071938806] [2024-09-17 19:22:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:18,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:22:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:22:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:22:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,020 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:22:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 19:22:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-17 19:22:19,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:22:19,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071938806] [2024-09-17 19:22:19,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071938806] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:22:19,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:22:19,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 19:22:19,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364308573] [2024-09-17 19:22:19,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:22:19,039 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 19:22:19,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:22:19,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 19:22:19,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-17 19:22:19,040 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-17 19:22:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:19,274 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-09-17 19:22:19,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-17 19:22:19,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2024-09-17 19:22:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:19,277 INFO L225 Difference]: With dead ends: 62 [2024-09-17 19:22:19,277 INFO L226 Difference]: Without dead ends: 60 [2024-09-17 19:22:19,277 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-17 19:22:19,292 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:22:19,292 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 65 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:22:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-17 19:22:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2024-09-17 19:22:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-17 19:22:19,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-09-17 19:22:19,311 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 28 [2024-09-17 19:22:19,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:19,312 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-09-17 19:22:19,312 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-17 19:22:19,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:19,312 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-09-17 19:22:19,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-17 19:22:19,313 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:19,313 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:19,313 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-17 19:22:19,313 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:19,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:19,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2135763327, now seen corresponding path program 1 times [2024-09-17 19:22:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:22:19,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473554692] [2024-09-17 19:22:19,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:19,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:22:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,488 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:22:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:22:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:22:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,506 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 19:22:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-17 19:22:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-17 19:22:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:22:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473554692] [2024-09-17 19:22:19,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473554692] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:22:19,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:22:19,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-17 19:22:19,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698921461] [2024-09-17 19:22:19,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:22:19,538 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-17 19:22:19,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:22:19,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-17 19:22:19,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-17 19:22:19,541 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-17 19:22:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:19,710 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-09-17 19:22:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-17 19:22:19,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 31 [2024-09-17 19:22:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:19,715 INFO L225 Difference]: With dead ends: 61 [2024-09-17 19:22:19,715 INFO L226 Difference]: Without dead ends: 53 [2024-09-17 19:22:19,715 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-09-17 19:22:19,716 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:22:19,716 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 54 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 19:22:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-17 19:22:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-17 19:22:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-17 19:22:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-09-17 19:22:19,729 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 31 [2024-09-17 19:22:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:19,730 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-09-17 19:22:19,730 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-17 19:22:19,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-09-17 19:22:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-17 19:22:19,732 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:19,732 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:19,733 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-17 19:22:19,733 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:19,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1566356218, now seen corresponding path program 1 times [2024-09-17 19:22:19,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:22:19,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973941455] [2024-09-17 19:22:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:19,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:22:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:22:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,961 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:22:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:22:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 19:22:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,975 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-17 19:22:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-17 19:22:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 19:22:19,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:22:19,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973941455] [2024-09-17 19:22:19,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973941455] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:22:19,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312727170] [2024-09-17 19:22:19,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:19,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:22:19,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:22:19,990 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-17 19:22:19,991 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-17 19:22:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-17 19:22:20,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:22:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 19:22:20,219 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 19:22:20,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312727170] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:22:20,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-17 19:22:20,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2024-09-17 19:22:20,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592562888] [2024-09-17 19:22:20,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:22:20,220 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-17 19:22:20,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:22:20,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-17 19:22:20,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-09-17 19:22:20,221 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-17 19:22:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:20,373 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-09-17 19:22:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-17 19:22:20,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2024-09-17 19:22:20,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:20,374 INFO L225 Difference]: With dead ends: 68 [2024-09-17 19:22:20,374 INFO L226 Difference]: Without dead ends: 66 [2024-09-17 19:22:20,375 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-09-17 19:22:20,375 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:22:20,376 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 201 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 19:22:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-17 19:22:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 40. [2024-09-17 19:22:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-17 19:22:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-09-17 19:22:20,391 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 43 [2024-09-17 19:22:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:20,395 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-09-17 19:22:20,395 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-17 19:22:20,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-09-17 19:22:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-17 19:22:20,396 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:20,397 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:20,420 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-17 19:22:20,600 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:22:20,601 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:20,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:20,601 INFO L85 PathProgramCache]: Analyzing trace with hash -920124993, now seen corresponding path program 1 times [2024-09-17 19:22:20,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:22:20,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107058370] [2024-09-17 19:22:20,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:20,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:22:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:22:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:22:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:22:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 19:22:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-17 19:22:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-17 19:22:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-17 19:22:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 19:22:20,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:22:20,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107058370] [2024-09-17 19:22:20,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107058370] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:22:20,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791545334] [2024-09-17 19:22:20,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:20,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:22:20,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:22:20,737 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-17 19:22:20,738 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-17 19:22:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-17 19:22:20,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:22:20,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-17 19:22:20,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-09-17 19:22:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-17 19:22:20,991 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 19:22:20,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791545334] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:22:20,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-17 19:22:20,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 12 [2024-09-17 19:22:20,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513000032] [2024-09-17 19:22:20,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:22:20,992 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-17 19:22:20,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:22:20,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-17 19:22:20,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-09-17 19:22:20,992 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-17 19:22:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:21,074 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-09-17 19:22:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-17 19:22:21,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2024-09-17 19:22:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:21,075 INFO L225 Difference]: With dead ends: 72 [2024-09-17 19:22:21,075 INFO L226 Difference]: Without dead ends: 46 [2024-09-17 19:22:21,075 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-09-17 19:22:21,076 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:22:21,076 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 19:22:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-17 19:22:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-09-17 19:22:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-17 19:22:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2024-09-17 19:22:21,083 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 46 [2024-09-17 19:22:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:21,083 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2024-09-17 19:22:21,083 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-17 19:22:21,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-09-17 19:22:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-17 19:22:21,084 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:21,084 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:21,099 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-17 19:22:21,288 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:22:21,289 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:21,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1621189571, now seen corresponding path program 1 times [2024-09-17 19:22:21,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:22:21,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52879920] [2024-09-17 19:22:21,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:21,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:22:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:21,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:22:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:21,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:22:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:21,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 19:22:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:21,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 19:22:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:21,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-17 19:22:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:21,478 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-17 19:22:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:21,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-17 19:22:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 19:22:21,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:22:21,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52879920] [2024-09-17 19:22:21,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52879920] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:22:21,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356585135] [2024-09-17 19:22:21,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:21,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:22:21,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:22:21,486 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-17 19:22:21,487 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-17 19:22:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:21,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-17 19:22:21,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:22:21,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-17 19:22:21,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-09-17 19:22:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-17 19:22:21,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:22:29,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356585135] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:22:29,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 19:22:29,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 22 [2024-09-17 19:22:29,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196305408] [2024-09-17 19:22:29,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 19:22:29,935 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-17 19:22:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:22:29,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-17 19:22:29,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-09-17 19:22:29,936 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-17 19:22:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:30,358 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-09-17 19:22:30,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-17 19:22:30,359 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 46 [2024-09-17 19:22:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:30,359 INFO L225 Difference]: With dead ends: 46 [2024-09-17 19:22:30,359 INFO L226 Difference]: Without dead ends: 0 [2024-09-17 19:22:30,360 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2024-09-17 19:22:30,360 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-17 19:22:30,361 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 91 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-17 19:22:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-17 19:22:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-17 19:22:30,361 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-17 19:22:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-17 19:22:30,362 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-09-17 19:22:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:30,362 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-17 19:22:30,362 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-17 19:22:30,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-17 19:22:30,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-17 19:22:30,364 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-17 19:22:30,379 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-17 19:22:30,568 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-17 19:22:30,571 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-17 19:22:30,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-17 19:22:31,588 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-17 19:22:31,599 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:126) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:109) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionToString(BacktranslationService.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.translateTerm(ProcedureContractResult.java:69) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.(ProcedureContractResult.java:59) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-09-17 19:22:31,602 INFO L158 Benchmark]: Toolchain (without parser) took 14007.21ms. Allocated memory was 142.6MB in the beginning and 289.4MB in the end (delta: 146.8MB). Free memory was 73.8MB in the beginning and 142.4MB in the end (delta: -68.6MB). Peak memory consumption was 132.7MB. Max. memory is 16.1GB. [2024-09-17 19:22:31,602 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 19:22:31,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.87ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 61.8MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-17 19:22:31,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.17ms. Allocated memory is still 142.6MB. Free memory was 61.8MB in the beginning and 60.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 19:22:31,603 INFO L158 Benchmark]: Boogie Preprocessor took 31.68ms. Allocated memory is still 142.6MB. Free memory was 60.6MB in the beginning and 58.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 19:22:31,603 INFO L158 Benchmark]: RCFGBuilder took 354.53ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 58.7MB in the beginning and 194.6MB in the end (delta: -136.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-09-17 19:22:31,603 INFO L158 Benchmark]: TraceAbstraction took 13406.43ms. Allocated memory was 232.8MB in the beginning and 289.4MB in the end (delta: 56.6MB). Free memory was 193.6MB in the beginning and 142.4MB in the end (delta: 51.2MB). Peak memory consumption was 161.7MB. Max. memory is 16.1GB. [2024-09-17 19:22:31,604 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.87ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 61.8MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.17ms. Allocated memory is still 142.6MB. Free memory was 61.8MB in the beginning and 60.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.68ms. Allocated memory is still 142.6MB. Free memory was 60.6MB in the beginning and 58.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.53ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 58.7MB in the beginning and 194.6MB in the end (delta: -136.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13406.43ms. Allocated memory was 232.8MB in the beginning and 289.4MB in the end (delta: 56.6MB). Free memory was 193.6MB in the beginning and 142.4MB in the end (delta: 51.2MB). Peak memory consumption was 161.7MB. 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: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 575 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 451 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1307 IncrementalHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 124 mSDtfsCounter, 1307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 188 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, InterpolantAutomatonStates: 55, 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, 6 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 348 ConstructedInterpolants, 22 QuantifiedInterpolants, 1064 SizeOfPredicates, 21 NumberOfNonLiveVariables, 563 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 93/110 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 1 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-09-17 19:22:31,628 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-17 19:22:33,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 19:22:33,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-17 19:22:33,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 19:22:33,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 19:22:33,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 19:22:33,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 19:22:33,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 19:22:33,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 19:22:33,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 19:22:33,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 19:22:33,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 19:22:33,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 19:22:33,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 19:22:33,789 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 19:22:33,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 19:22:33,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 19:22:33,790 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 19:22:33,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 19:22:33,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 19:22:33,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 19:22:33,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 19:22:33,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 19:22:33,792 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-17 19:22:33,792 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-17 19:22:33,792 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 19:22:33,792 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-17 19:22:33,792 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 19:22:33,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 19:22:33,793 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 19:22:33,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 19:22:33,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 19:22:33,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 19:22:33,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 19:22:33,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 19:22:33,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 19:22:33,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 19:22:33,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 19:22:33,794 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-17 19:22:33,794 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-17 19:22:33,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 19:22:33,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 19:22:33,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 19:22:33,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 19:22:33,796 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-17 19:22:33,796 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-17 19:22:34,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 19:22:34,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 19:22:34,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 19:22:34,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 19:22:34,050 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 19:22:34,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-17 19:22:35,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 19:22:35,586 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 19:22:35,587 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-17 19:22:35,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0034575ff/c5ee3db6bf5c4dc89bfbb5306dd88960/FLAG0ec4c22f0 [2024-09-17 19:22:35,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0034575ff/c5ee3db6bf5c4dc89bfbb5306dd88960 [2024-09-17 19:22:35,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 19:22:35,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 19:22:35,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 19:22:35,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 19:22:35,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 19:22:35,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261d3c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35, skipping insertion in model container [2024-09-17 19:22:35,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 19:22:35,750 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-17 19:22:35,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 19:22:35,774 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 19:22:35,800 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-17 19:22:35,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 19:22:35,827 INFO L204 MainTranslator]: Completed translation [2024-09-17 19:22:35,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35 WrapperNode [2024-09-17 19:22:35,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 19:22:35,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 19:22:35,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 19:22:35,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 19:22:35,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,847 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 19:22:35,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 19:22:35,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 19:22:35,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 19:22:35,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 19:22:35,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,857 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,867 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-17 19:22:35,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 19:22:35,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 19:22:35,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 19:22:35,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 19:22:35,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (1/1) ... [2024-09-17 19:22:35,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 19:22:35,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:22:35,913 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-17 19:22:35,916 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-17 19:22:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 19:22:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-17 19:22:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-17 19:22:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-17 19:22:35,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-17 19:22:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 19:22:35,948 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 19:22:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-17 19:22:35,948 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-17 19:22:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 19:22:35,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 19:22:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-17 19:22:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-17 19:22:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-17 19:22:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 19:22:35,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 19:22:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-17 19:22:35,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-17 19:22:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-17 19:22:35,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-17 19:22:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-17 19:22:36,015 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 19:22:36,021 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 19:22:36,146 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-17 19:22:36,146 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 19:22:36,161 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 19:22:36,162 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-17 19:22:36,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:22:36 BoogieIcfgContainer [2024-09-17 19:22:36,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 19:22:36,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 19:22:36,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 19:22:36,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 19:22:36,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 07:22:35" (1/3) ... [2024-09-17 19:22:36,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5ea2bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 07:22:36, skipping insertion in model container [2024-09-17 19:22:36,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:35" (2/3) ... [2024-09-17 19:22:36,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5ea2bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 07:22:36, skipping insertion in model container [2024-09-17 19:22:36,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:22:36" (3/3) ... [2024-09-17 19:22:36,170 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-09-17 19:22:36,183 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 19:22:36,183 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 19:22:36,217 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 19:22:36,221 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5dd7e734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 19:22:36,222 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 19:22:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-17 19:22:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-17 19:22:36,229 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:36,230 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:36,230 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:36,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1437097425, now seen corresponding path program 1 times [2024-09-17 19:22:36,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 19:22:36,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621030093] [2024-09-17 19:22:36,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:36,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-17 19:22:36,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 19:22:36,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-17 19:22:36,246 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-09-17 19:22:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:36,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-17 19:22:36,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:22:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-17 19:22:36,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 19:22:36,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 19:22:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621030093] [2024-09-17 19:22:36,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621030093] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:22:36,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:22:36,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-17 19:22:36,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744896224] [2024-09-17 19:22:36,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:22:36,338 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-17 19:22:36,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 19:22:36,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-17 19:22:36,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-17 19:22:36,354 INFO L87 Difference]: Start difference. First operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-17 19:22:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:36,374 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-09-17 19:22:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-17 19:22:36,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-17 19:22:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:36,381 INFO L225 Difference]: With dead ends: 78 [2024-09-17 19:22:36,381 INFO L226 Difference]: Without dead ends: 38 [2024-09-17 19:22:36,384 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 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-17 19:22:36,386 INFO L434 NwaCegarLoop]: 45 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, 45 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-17 19:22:36,387 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 19:22:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-17 19:22:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-17 19:22:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-17 19:22:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-17 19:22:36,411 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-09-17 19:22:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:36,412 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-17 19:22:36,412 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-17 19:22:36,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-17 19:22:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-17 19:22:36,413 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:36,414 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:36,417 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-09-17 19:22:36,614 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-17 19:22:36,614 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:36,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:36,615 INFO L85 PathProgramCache]: Analyzing trace with hash 579935573, now seen corresponding path program 1 times [2024-09-17 19:22:36,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 19:22:36,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466669307] [2024-09-17 19:22:36,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:36,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-17 19:22:36,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 19:22:36,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-17 19:22:36,621 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-09-17 19:22:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:36,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-17 19:22:36,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:22:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-17 19:22:37,027 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 19:22:37,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 19:22:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466669307] [2024-09-17 19:22:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466669307] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:22:37,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:22:37,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-17 19:22:37,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558373618] [2024-09-17 19:22:37,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:22:37,029 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-17 19:22:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 19:22:37,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-17 19:22:37,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-09-17 19:22:37,030 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-17 19:22:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:37,301 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-09-17 19:22:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-17 19:22:37,302 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-09-17 19:22:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:37,303 INFO L225 Difference]: With dead ends: 56 [2024-09-17 19:22:37,303 INFO L226 Difference]: Without dead ends: 54 [2024-09-17 19:22:37,307 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-09-17 19:22:37,308 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:22:37,309 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 220 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:22:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-17 19:22:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-17 19:22:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-17 19:22:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-09-17 19:22:37,329 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 28 [2024-09-17 19:22:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:37,330 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-09-17 19:22:37,331 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-17 19:22:37,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-09-17 19:22:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-17 19:22:37,332 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:37,332 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:37,336 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-09-17 19:22:37,536 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-17 19:22:37,536 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:37,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:37,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2135763327, now seen corresponding path program 1 times [2024-09-17 19:22:37,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 19:22:37,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596833134] [2024-09-17 19:22:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:37,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-17 19:22:37,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 19:22:37,540 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-17 19:22:37,542 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-09-17 19:22:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:37,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-17 19:22:37,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:22:38,082 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-17 19:22:38,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-17 19:22:38,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2024-09-17 19:22:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-17 19:22:38,156 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 19:22:38,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 19:22:38,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596833134] [2024-09-17 19:22:38,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596833134] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:22:38,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:22:38,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-09-17 19:22:38,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238677529] [2024-09-17 19:22:38,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:22:38,158 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-17 19:22:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 19:22:38,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-17 19:22:38,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-09-17 19:22:38,159 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-17 19:22:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:38,464 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-09-17 19:22:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-17 19:22:38,467 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2024-09-17 19:22:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:38,468 INFO L225 Difference]: With dead ends: 66 [2024-09-17 19:22:38,469 INFO L226 Difference]: Without dead ends: 56 [2024-09-17 19:22:38,469 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-09-17 19:22:38,470 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-17 19:22:38,470 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 285 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-17 19:22:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-17 19:22:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-09-17 19:22:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-17 19:22:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-09-17 19:22:38,483 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 31 [2024-09-17 19:22:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:38,483 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-09-17 19:22:38,483 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-17 19:22:38,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:38,484 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-09-17 19:22:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-17 19:22:38,485 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:38,485 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:38,494 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-09-17 19:22:38,687 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-17 19:22:38,688 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:38,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:38,688 INFO L85 PathProgramCache]: Analyzing trace with hash 757009592, now seen corresponding path program 1 times [2024-09-17 19:22:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 19:22:38,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010528790] [2024-09-17 19:22:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:38,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-17 19:22:38,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 19:22:38,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-17 19:22:38,705 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-09-17 19:22:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:38,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-17 19:22:38,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:22:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-17 19:22:39,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:22:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 19:22:39,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 19:22:39,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010528790] [2024-09-17 19:22:39,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010528790] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:22:39,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 19:22:39,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2024-09-17 19:22:39,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133862676] [2024-09-17 19:22:39,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 19:22:39,684 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-17 19:22:39,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 19:22:39,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-17 19:22:39,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-09-17 19:22:39,686 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-17 19:22:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:41,187 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2024-09-17 19:22:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-17 19:22:41,188 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 43 [2024-09-17 19:22:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:41,190 INFO L225 Difference]: With dead ends: 108 [2024-09-17 19:22:41,190 INFO L226 Difference]: Without dead ends: 106 [2024-09-17 19:22:41,190 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2024-09-17 19:22:41,191 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-17 19:22:41,191 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 441 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-17 19:22:41,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-17 19:22:41,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2024-09-17 19:22:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 52 states have internal predecessors, (56), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-17 19:22:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2024-09-17 19:22:41,209 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 43 [2024-09-17 19:22:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:41,210 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2024-09-17 19:22:41,210 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-17 19:22:41,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2024-09-17 19:22:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-17 19:22:41,211 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:41,211 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:41,215 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-09-17 19:22:41,414 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-17 19:22:41,414 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:41,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:41,415 INFO L85 PathProgramCache]: Analyzing trace with hash -920124993, now seen corresponding path program 1 times [2024-09-17 19:22:41,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 19:22:41,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618324899] [2024-09-17 19:22:41,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:41,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-17 19:22:41,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 19:22:41,418 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-17 19:22:41,419 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-09-17 19:22:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:41,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-17 19:22:41,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:22:42,301 INFO L349 Elim1Store]: treesize reduction 80, result has 41.6 percent of original size [2024-09-17 19:22:42,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 71 [2024-09-17 19:22:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-17 19:22:42,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:22:51,441 INFO L349 Elim1Store]: treesize reduction 15, result has 59.5 percent of original size [2024-09-17 19:22:51,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 28 [2024-09-17 19:22:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-17 19:22:52,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 19:22:52,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618324899] [2024-09-17 19:22:52,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618324899] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:22:52,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 19:22:52,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2024-09-17 19:22:52,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094787666] [2024-09-17 19:22:52,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 19:22:52,383 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-17 19:22:52,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 19:22:52,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-17 19:22:52,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=952, Unknown=2, NotChecked=0, Total=1056 [2024-09-17 19:22:52,384 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-17 19:23:07,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-17 19:23:11,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-17 19:23:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:23:13,029 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2024-09-17 19:23:13,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-17 19:23:13,030 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) Word has length 46 [2024-09-17 19:23:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:23:13,031 INFO L225 Difference]: With dead ends: 165 [2024-09-17 19:23:13,031 INFO L226 Difference]: Without dead ends: 163 [2024-09-17 19:23:13,032 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=257, Invalid=2496, Unknown=3, NotChecked=0, Total=2756 [2024-09-17 19:23:13,033 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 84 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:23:13,033 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 632 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 673 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2024-09-17 19:23:13,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-09-17 19:23:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2024-09-17 19:23:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 93 states have internal predecessors, (98), 40 states have call successors, (40), 18 states have call predecessors, (40), 20 states have return successors, (42), 34 states have call predecessors, (42), 37 states have call successors, (42) [2024-09-17 19:23:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 180 transitions. [2024-09-17 19:23:13,076 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 180 transitions. Word has length 46 [2024-09-17 19:23:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:23:13,076 INFO L474 AbstractCegarLoop]: Abstraction has 146 states and 180 transitions. [2024-09-17 19:23:13,076 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-17 19:23:13,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:23:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 180 transitions. [2024-09-17 19:23:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-17 19:23:13,079 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:23:13,079 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:23:13,083 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-09-17 19:23:13,280 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-17 19:23:13,282 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:23:13,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:23:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash 986908330, now seen corresponding path program 1 times [2024-09-17 19:23:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 19:23:13,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802715186] [2024-09-17 19:23:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:23:13,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-17 19:23:13,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 19:23:13,286 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-17 19:23:13,287 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-09-17 19:23:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:23:13,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-17 19:23:13,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:23:13,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-17 19:23:13,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-09-17 19:23:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-17 19:23:13,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:23:14,391 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2024-09-17 19:23:14,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 95 [2024-09-17 19:23:15,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 19:23:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802715186] [2024-09-17 19:23:15,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802715186] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:23:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1601603656] [2024-09-17 19:23:15,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:23:15,009 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-17 19:23:15,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-17 19:23:15,011 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-17 19:23:15,012 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-09-17 19:23:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:23:15,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-17 19:23:15,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:23:15,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-17 19:23:19,248 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_2 (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| v_main_~a~0.base_BEFORE_CALL_2))) is different from true [2024-09-17 19:24:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2024-09-17 19:24:25,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:25:01,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1601603656] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:25:01,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 19:25:01,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-09-17 19:25:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105120607] [2024-09-17 19:25:01,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 19:25:01,669 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-17 19:25:01,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 19:25:01,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-17 19:25:01,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=723, Unknown=19, NotChecked=54, Total=870 [2024-09-17 19:25:01,670 INFO L87 Difference]: Start difference. First operand 146 states and 180 transitions. Second operand has 23 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 9 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2024-09-17 19:25:10,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:25:14,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:25:18,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:25:34,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:25:46,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:25:50,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:25:54,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:25:58,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:26:02,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:26:11,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:26:40,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:26:44,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:26:48,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:26:52,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 19:26:56,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]