./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-18 16:42:29,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-18 16:42:29,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-18 16:42:29,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-18 16:42:29,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-18 16:42:29,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-18 16:42:29,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-18 16:42:29,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-18 16:42:29,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-18 16:42:29,112 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-18 16:42:29,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-18 16:42:29,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-18 16:42:29,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-18 16:42:29,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-18 16:42:29,117 INFO L153 SettingsManager]: * Use SBE=true [2024-09-18 16:42:29,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-18 16:42:29,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-18 16:42:29,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-18 16:42:29,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-18 16:42:29,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-18 16:42:29,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-18 16:42:29,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-18 16:42:29,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-18 16:42:29,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-18 16:42:29,121 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-18 16:42:29,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-18 16:42:29,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-18 16:42:29,122 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-18 16:42:29,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-18 16:42:29,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-18 16:42:29,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-18 16:42:29,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-18 16:42:29,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 16:42:29,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-18 16:42:29,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-18 16:42:29,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-18 16:42:29,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-18 16:42:29,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-18 16:42:29,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-18 16:42:29,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-18 16:42:29,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-18 16:42:29,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-18 16:42:29,127 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-18 16:42:29,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-18 16:42:29,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-18 16:42:29,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-18 16:42:29,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-18 16:42:29,414 INFO L274 PluginConnector]: CDTParser initialized [2024-09-18 16:42:29,415 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-18 16:42:30,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-18 16:42:31,025 INFO L384 CDTParser]: Found 1 translation units. [2024-09-18 16:42:31,025 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-18 16:42:31,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/66b5bc38c/e0911bed208d44b48f6cb056295509cf/FLAG8c8699518 [2024-09-18 16:42:31,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/66b5bc38c/e0911bed208d44b48f6cb056295509cf [2024-09-18 16:42:31,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-18 16:42:31,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-18 16:42:31,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-18 16:42:31,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-18 16:42:31,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-18 16:42:31,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75bbf898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31, skipping insertion in model container [2024-09-18 16:42:31,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-18 16:42:31,209 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-18 16:42:31,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 16:42:31,236 INFO L200 MainTranslator]: Completed pre-run [2024-09-18 16:42:31,248 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-18 16:42:31,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 16:42:31,279 INFO L204 MainTranslator]: Completed translation [2024-09-18 16:42:31,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31 WrapperNode [2024-09-18 16:42:31,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-18 16:42:31,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-18 16:42:31,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-18 16:42:31,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-18 16:42:31,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,309 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-18 16:42:31,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-18 16:42:31,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-18 16:42:31,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-18 16:42:31,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-18 16:42:31,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,343 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-18 16:42:31,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-18 16:42:31,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-18 16:42:31,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-18 16:42:31,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-18 16:42:31,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (1/1) ... [2024-09-18 16:42:31,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 16:42:31,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:42:31,399 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-18 16:42:31,405 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-18 16:42:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-18 16:42:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-18 16:42:31,443 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-18 16:42:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-18 16:42:31,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-18 16:42:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-18 16:42:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-18 16:42:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-18 16:42:31,444 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-18 16:42:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-18 16:42:31,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-18 16:42:31,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-18 16:42:31,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-18 16:42:31,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-18 16:42:31,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-18 16:42:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-18 16:42:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-18 16:42:31,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-18 16:42:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-18 16:42:31,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-18 16:42:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-18 16:42:31,518 INFO L242 CfgBuilder]: Building ICFG [2024-09-18 16:42:31,519 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-18 16:42:31,678 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-18 16:42:31,678 INFO L291 CfgBuilder]: Performing block encoding [2024-09-18 16:42:31,697 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-18 16:42:31,697 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-18 16:42:31,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 04:42:31 BoogieIcfgContainer [2024-09-18 16:42:31,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-18 16:42:31,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-18 16:42:31,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-18 16:42:31,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-18 16:42:31,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 04:42:31" (1/3) ... [2024-09-18 16:42:31,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341f482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 04:42:31, skipping insertion in model container [2024-09-18 16:42:31,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:31" (2/3) ... [2024-09-18 16:42:31,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341f482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 04:42:31, skipping insertion in model container [2024-09-18 16:42:31,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 04:42:31" (3/3) ... [2024-09-18 16:42:31,709 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-09-18 16:42:31,723 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-18 16:42:31,724 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-18 16:42:31,773 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-18 16:42:31,780 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;@18d235e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-18 16:42:31,780 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-18 16:42:31,785 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-18 16:42:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-18 16:42:31,793 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:42:31,793 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-18 16:42:31,794 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:42:31,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1437097425, now seen corresponding path program 1 times [2024-09-18 16:42:31,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:42:31,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728996275] [2024-09-18 16:42:31,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:31,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:42:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:31,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 16:42:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:32,016 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 16:42:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:32,022 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-18 16:42:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:32,035 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-18 16:42:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:32,043 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-18 16:42:32,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:42:32,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728996275] [2024-09-18 16:42:32,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728996275] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 16:42:32,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 16:42:32,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-18 16:42:32,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526008916] [2024-09-18 16:42:32,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 16:42:32,059 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-18 16:42:32,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:42:32,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-18 16:42:32,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-18 16:42:32,097 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-18 16:42:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:42:32,239 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-09-18 16:42:32,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-18 16:42:32,242 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-18 16:42:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:42:32,249 INFO L225 Difference]: With dead ends: 78 [2024-09-18 16:42:32,250 INFO L226 Difference]: Without dead ends: 38 [2024-09-18 16:42:32,254 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-18 16:42:32,258 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-18 16:42:32,259 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-18 16:42:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-18 16:42:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-18 16:42:32,305 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-18 16:42:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-18 16:42:32,309 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-09-18 16:42:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:42:32,310 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-18 16:42:32,310 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-18 16:42:32,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-18 16:42:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-18 16:42:32,313 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:42:32,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] [2024-09-18 16:42:32,314 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-18 16:42:32,314 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:42:32,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash 579935573, now seen corresponding path program 1 times [2024-09-18 16:42:32,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:42:32,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654227443] [2024-09-18 16:42:32,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:42:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:32,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 16:42:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:32,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 16:42:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:32,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-18 16:42:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:32,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-18 16:42:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:32,700 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-18 16:42:32,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:42:32,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654227443] [2024-09-18 16:42:32,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654227443] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 16:42:32,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 16:42:32,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-18 16:42:32,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831185396] [2024-09-18 16:42:32,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 16:42:32,705 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-18 16:42:32,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:42:32,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-18 16:42:32,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-18 16:42:32,707 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-18 16:42:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:42:33,004 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-09-18 16:42:33,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-18 16:42:33,005 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-18 16:42:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:42:33,008 INFO L225 Difference]: With dead ends: 62 [2024-09-18 16:42:33,008 INFO L226 Difference]: Without dead ends: 60 [2024-09-18 16:42:33,009 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-18 16:42:33,011 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-18 16:42:33,012 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-18 16:42:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-18 16:42:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2024-09-18 16:42:33,028 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-18 16:42:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-09-18 16:42:33,031 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 28 [2024-09-18 16:42:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:42:33,033 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-09-18 16:42:33,033 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-18 16:42:33,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-09-18 16:42:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-18 16:42:33,034 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:42:33,034 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-18 16:42:33,034 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-18 16:42:33,035 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:42:33,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2135763327, now seen corresponding path program 1 times [2024-09-18 16:42:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:42:33,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934042925] [2024-09-18 16:42:33,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:42:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 16:42:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 16:42:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-18 16:42:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-18 16:42:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,267 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-18 16:42:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,274 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-18 16:42:33,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:42:33,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934042925] [2024-09-18 16:42:33,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934042925] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 16:42:33,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 16:42:33,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-18 16:42:33,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182218259] [2024-09-18 16:42:33,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 16:42:33,277 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-18 16:42:33,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:42:33,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-18 16:42:33,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-18 16:42:33,280 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-18 16:42:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:42:33,517 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-09-18 16:42:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-18 16:42:33,518 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-18 16:42:33,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:42:33,519 INFO L225 Difference]: With dead ends: 61 [2024-09-18 16:42:33,519 INFO L226 Difference]: Without dead ends: 53 [2024-09-18 16:42:33,519 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-18 16:42:33,520 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-09-18 16:42:33,521 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.2s Time] [2024-09-18 16:42:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-18 16:42:33,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-18 16:42:33,537 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-18 16:42:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-09-18 16:42:33,538 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 31 [2024-09-18 16:42:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:42:33,539 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-09-18 16:42:33,539 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-18 16:42:33,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:33,541 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-09-18 16:42:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-18 16:42:33,542 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:42:33,542 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-18 16:42:33,543 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-18 16:42:33,543 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:42:33,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:33,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1566356218, now seen corresponding path program 1 times [2024-09-18 16:42:33,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:42:33,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388403425] [2024-09-18 16:42:33,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:33,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:42:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 16:42:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 16:42:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-18 16:42:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-18 16:42:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-18 16:42:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-18 16:42:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,868 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-18 16:42:33,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:42:33,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388403425] [2024-09-18 16:42:33,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388403425] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 16:42:33,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211363905] [2024-09-18 16:42:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:33,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:42:33,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:42:33,872 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-18 16:42:33,874 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-18 16:42:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:33,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-18 16:42:33,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:42:34,128 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-18 16:42:34,129 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 16:42:34,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211363905] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 16:42:34,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-18 16:42:34,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2024-09-18 16:42:34,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227003221] [2024-09-18 16:42:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 16:42:34,133 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-18 16:42:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:42:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-18 16:42:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-09-18 16:42:34,135 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-18 16:42:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:42:34,335 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-09-18 16:42:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-18 16:42:34,336 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-18 16:42:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:42:34,337 INFO L225 Difference]: With dead ends: 68 [2024-09-18 16:42:34,337 INFO L226 Difference]: Without dead ends: 66 [2024-09-18 16:42:34,338 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-09-18 16:42:34,339 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-18 16:42:34,339 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-18 16:42:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-18 16:42:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 40. [2024-09-18 16:42:34,348 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-18 16:42:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-09-18 16:42:34,349 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 43 [2024-09-18 16:42:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:42:34,349 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-09-18 16:42:34,349 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-18 16:42:34,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-09-18 16:42:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-18 16:42:34,351 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:42:34,351 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-18 16:42:34,368 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-18 16:42:34,552 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-18 16:42:34,552 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:42:34,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:34,553 INFO L85 PathProgramCache]: Analyzing trace with hash -920124993, now seen corresponding path program 1 times [2024-09-18 16:42:34,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:42:34,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515821113] [2024-09-18 16:42:34,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:34,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:42:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:34,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 16:42:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:34,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 16:42:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:34,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-18 16:42:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:34,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-18 16:42:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:34,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-18 16:42:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:34,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-18 16:42:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:34,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-18 16:42:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:34,807 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-18 16:42:34,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:42:34,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515821113] [2024-09-18 16:42:34,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515821113] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 16:42:34,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956754862] [2024-09-18 16:42:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:34,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:42:34,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:42:34,811 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-18 16:42:34,813 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-18 16:42:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:34,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-18 16:42:34,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:42:34,926 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-18 16:42:35,074 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-18 16:42:35,113 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-18 16:42:35,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 16:42:35,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956754862] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 16:42:35,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-18 16:42:35,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 12 [2024-09-18 16:42:35,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196435790] [2024-09-18 16:42:35,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 16:42:35,114 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-18 16:42:35,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:42:35,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-18 16:42:35,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-09-18 16:42:35,116 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-18 16:42:35,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:42:35,227 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-09-18 16:42:35,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-18 16:42:35,228 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-18 16:42:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:42:35,230 INFO L225 Difference]: With dead ends: 72 [2024-09-18 16:42:35,230 INFO L226 Difference]: Without dead ends: 46 [2024-09-18 16:42:35,230 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-09-18 16:42:35,231 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-18 16:42:35,231 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-18 16:42:35,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-18 16:42:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-09-18 16:42:35,251 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-18 16:42:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2024-09-18 16:42:35,252 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 46 [2024-09-18 16:42:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:42:35,252 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2024-09-18 16:42:35,252 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-18 16:42:35,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-09-18 16:42:35,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-18 16:42:35,255 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:42:35,256 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-18 16:42:35,272 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-18 16:42:35,459 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-18 16:42:35,460 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:42:35,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1621189571, now seen corresponding path program 1 times [2024-09-18 16:42:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:42:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859972820] [2024-09-18 16:42:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:35,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:42:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:35,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 16:42:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:35,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 16:42:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:35,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-18 16:42:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:35,636 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-18 16:42:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:35,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-18 16:42:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:35,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-18 16:42:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:35,672 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-18 16:42:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:35,675 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-18 16:42:35,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:42:35,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859972820] [2024-09-18 16:42:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859972820] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 16:42:35,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440797328] [2024-09-18 16:42:35,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:35,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:42:35,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:42:35,678 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-18 16:42:35,679 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-18 16:42:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:35,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-18 16:42:35,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:42:35,805 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-18 16:42:36,022 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-18 16:42:36,111 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-18 16:42:36,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 16:42:44,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440797328] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 16:42:44,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 16:42:44,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 22 [2024-09-18 16:42:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554185705] [2024-09-18 16:42:44,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 16:42:44,197 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-18 16:42:44,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:42:44,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-18 16:42:44,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-09-18 16:42:44,199 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-18 16:42:44,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:42:44,733 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-09-18 16:42:44,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-18 16:42:44,734 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-18 16:42:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:42:44,735 INFO L225 Difference]: With dead ends: 46 [2024-09-18 16:42:44,735 INFO L226 Difference]: Without dead ends: 0 [2024-09-18 16:42:44,736 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2024-09-18 16:42:44,736 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-18 16:42:44,736 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-18 16:42:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-18 16:42:44,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-18 16:42:44,738 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-18 16:42:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-18 16:42:44,742 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-09-18 16:42:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:42:44,742 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-18 16:42:44,742 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-18 16:42:44,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-18 16:42:44,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-18 16:42:44,746 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-18 16:42:44,765 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-18 16:42:44,950 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-18 16:42:44,953 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-18 16:42:44,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-18 16:42:46,218 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-18 16:42:46,232 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-18 16:42:46,236 INFO L158 Benchmark]: Toolchain (without parser) took 15188.58ms. Allocated memory was 192.9MB in the beginning and 255.9MB in the end (delta: 62.9MB). Free memory was 142.7MB in the beginning and 168.2MB in the end (delta: -25.5MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. [2024-09-18 16:42:46,237 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 192.9MB. Free memory is still 159.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-18 16:42:46,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.02ms. Allocated memory is still 192.9MB. Free memory was 142.2MB in the beginning and 130.5MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-18 16:42:46,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.19ms. Allocated memory is still 192.9MB. Free memory was 130.5MB in the beginning and 129.6MB in the end (delta: 931.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 16:42:46,238 INFO L158 Benchmark]: Boogie Preprocessor took 51.65ms. Allocated memory is still 192.9MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 16:42:46,238 INFO L158 Benchmark]: RCFGBuilder took 334.93ms. Allocated memory is still 192.9MB. Free memory was 127.5MB in the beginning and 111.6MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-18 16:42:46,239 INFO L158 Benchmark]: TraceAbstraction took 14535.26ms. Allocated memory was 192.9MB in the beginning and 255.9MB in the end (delta: 62.9MB). Free memory was 111.1MB in the beginning and 168.2MB in the end (delta: -57.1MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. [2024-09-18 16:42:46,241 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.27ms. Allocated memory is still 192.9MB. Free memory is still 159.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.02ms. Allocated memory is still 192.9MB. Free memory was 142.2MB in the beginning and 130.5MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.19ms. Allocated memory is still 192.9MB. Free memory was 130.5MB in the beginning and 129.6MB in the end (delta: 931.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.65ms. Allocated memory is still 192.9MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 334.93ms. Allocated memory is still 192.9MB. Free memory was 127.5MB in the beginning and 111.6MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14535.26ms. Allocated memory was 192.9MB in the beginning and 255.9MB in the end (delta: 62.9MB). Free memory was 111.1MB in the beginning and 168.2MB in the end (delta: -57.1MB). Peak memory consumption was 99.1MB. 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: 13.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 575 SdHoareTripleChecker+Invalid, 0.8s 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, 9.0s 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.2s 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-18 16:42:46,277 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-18 16:42:48,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-18 16:42:48,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-18 16:42:48,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-18 16:42:48,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-18 16:42:48,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-18 16:42:48,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-18 16:42:48,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-18 16:42:48,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-18 16:42:48,453 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-18 16:42:48,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-18 16:42:48,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-18 16:42:48,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-18 16:42:48,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-18 16:42:48,455 INFO L153 SettingsManager]: * Use SBE=true [2024-09-18 16:42:48,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-18 16:42:48,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-18 16:42:48,455 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-18 16:42:48,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-18 16:42:48,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-18 16:42:48,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-18 16:42:48,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-18 16:42:48,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-18 16:42:48,460 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-18 16:42:48,461 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-18 16:42:48,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-18 16:42:48,461 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-18 16:42:48,461 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-18 16:42:48,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-18 16:42:48,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-18 16:42:48,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-18 16:42:48,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-18 16:42:48,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-18 16:42:48,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-18 16:42:48,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 16:42:48,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-18 16:42:48,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-18 16:42:48,465 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-18 16:42:48,465 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-18 16:42:48,465 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-18 16:42:48,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-18 16:42:48,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-18 16:42:48,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-18 16:42:48,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-18 16:42:48,467 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-18 16:42:48,467 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-18 16:42:48,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-18 16:42:48,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-18 16:42:48,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-18 16:42:48,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-18 16:42:48,814 INFO L274 PluginConnector]: CDTParser initialized [2024-09-18 16:42:48,815 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-18 16:42:50,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-18 16:42:50,505 INFO L384 CDTParser]: Found 1 translation units. [2024-09-18 16:42:50,505 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-18 16:42:50,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/861e2a03b/e5d8be98b5064d4ca1f5eb11de47027b/FLAGd97a141b4 [2024-09-18 16:42:50,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/861e2a03b/e5d8be98b5064d4ca1f5eb11de47027b [2024-09-18 16:42:50,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-18 16:42:50,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-18 16:42:50,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-18 16:42:50,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-18 16:42:50,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-18 16:42:50,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf8bed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50, skipping insertion in model container [2024-09-18 16:42:50,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-18 16:42:50,713 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-18 16:42:50,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 16:42:50,767 INFO L200 MainTranslator]: Completed pre-run [2024-09-18 16:42:50,778 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-18 16:42:50,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 16:42:50,803 INFO L204 MainTranslator]: Completed translation [2024-09-18 16:42:50,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50 WrapperNode [2024-09-18 16:42:50,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-18 16:42:50,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-18 16:42:50,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-18 16:42:50,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-18 16:42:50,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,830 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-18 16:42:50,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-18 16:42:50,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-18 16:42:50,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-18 16:42:50,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-18 16:42:50,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,869 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-18 16:42:50,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-18 16:42:50,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-18 16:42:50,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-18 16:42:50,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-18 16:42:50,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (1/1) ... [2024-09-18 16:42:50,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 16:42:50,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:42:50,926 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-18 16:42:50,933 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-18 16:42:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-18 16:42:50,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-18 16:42:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-18 16:42:50,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-18 16:42:50,977 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-18 16:42:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-18 16:42:50,979 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-18 16:42:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-18 16:42:50,979 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-18 16:42:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-18 16:42:50,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-18 16:42:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-18 16:42:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-18 16:42:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-18 16:42:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-18 16:42:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-18 16:42:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-18 16:42:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-18 16:42:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-18 16:42:50,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-18 16:42:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-18 16:42:51,074 INFO L242 CfgBuilder]: Building ICFG [2024-09-18 16:42:51,076 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-18 16:42:51,328 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-18 16:42:51,328 INFO L291 CfgBuilder]: Performing block encoding [2024-09-18 16:42:51,353 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-18 16:42:51,356 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-18 16:42:51,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 04:42:51 BoogieIcfgContainer [2024-09-18 16:42:51,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-18 16:42:51,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-18 16:42:51,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-18 16:42:51,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-18 16:42:51,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 04:42:50" (1/3) ... [2024-09-18 16:42:51,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5794ba15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 04:42:51, skipping insertion in model container [2024-09-18 16:42:51,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 04:42:50" (2/3) ... [2024-09-18 16:42:51,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5794ba15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 04:42:51, skipping insertion in model container [2024-09-18 16:42:51,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 04:42:51" (3/3) ... [2024-09-18 16:42:51,366 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-09-18 16:42:51,387 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-18 16:42:51,387 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-18 16:42:51,440 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-18 16:42:51,446 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;@2b438f5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-18 16:42:51,446 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-18 16:42:51,450 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-18 16:42:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-18 16:42:51,456 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:42:51,457 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-18 16:42:51,458 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:42:51,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1437097425, now seen corresponding path program 1 times [2024-09-18 16:42:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 16:42:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883476367] [2024-09-18 16:42:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:51,475 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-18 16:42:51,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 16:42:51,478 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-18 16:42:51,479 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-18 16:42:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:51,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-18 16:42:51,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:42:51,615 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-18 16:42:51,615 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 16:42:51,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 16:42:51,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883476367] [2024-09-18 16:42:51,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883476367] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 16:42:51,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 16:42:51,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-18 16:42:51,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329747340] [2024-09-18 16:42:51,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 16:42:51,625 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-18 16:42:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 16:42:51,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-18 16:42:51,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-18 16:42:51,656 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-18 16:42:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:42:51,700 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-09-18 16:42:51,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-18 16:42:51,707 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-18 16:42:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:42:51,715 INFO L225 Difference]: With dead ends: 78 [2024-09-18 16:42:51,715 INFO L226 Difference]: Without dead ends: 38 [2024-09-18 16:42:51,719 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-18 16:42:51,726 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-18 16:42:51,727 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-18 16:42:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-18 16:42:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-18 16:42:51,769 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-18 16:42:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-18 16:42:51,773 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-09-18 16:42:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:42:51,775 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-18 16:42:51,776 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-18 16:42:51,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-18 16:42:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-18 16:42:51,780 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:42:51,780 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-18 16:42:51,785 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-09-18 16:42:51,981 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-18 16:42:51,981 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:42:51,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:51,982 INFO L85 PathProgramCache]: Analyzing trace with hash 579935573, now seen corresponding path program 1 times [2024-09-18 16:42:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 16:42:51,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322143641] [2024-09-18 16:42:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:51,983 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-18 16:42:51,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 16:42:51,987 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-18 16:42:51,988 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-18 16:42:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:52,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-18 16:42:52,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:42:52,454 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-18 16:42:52,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 16:42:52,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 16:42:52,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322143641] [2024-09-18 16:42:52,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322143641] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 16:42:52,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 16:42:52,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-18 16:42:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643363014] [2024-09-18 16:42:52,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 16:42:52,456 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-18 16:42:52,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 16:42:52,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-18 16:42:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-09-18 16:42:52,460 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-18 16:42:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:42:52,867 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-09-18 16:42:52,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-18 16:42:52,868 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-18 16:42:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:42:52,870 INFO L225 Difference]: With dead ends: 56 [2024-09-18 16:42:52,871 INFO L226 Difference]: Without dead ends: 54 [2024-09-18 16:42:52,871 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-09-18 16:42:52,873 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-09-18 16:42:52,875 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.3s Time] [2024-09-18 16:42:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-18 16:42:52,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-18 16:42:52,896 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-18 16:42:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-09-18 16:42:52,899 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 28 [2024-09-18 16:42:52,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:42:52,901 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-09-18 16:42:52,901 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-18 16:42:52,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-09-18 16:42:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-18 16:42:52,903 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:42:52,904 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-18 16:42:52,908 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-18 16:42:53,104 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-18 16:42:53,105 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:42:53,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:53,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2135763327, now seen corresponding path program 1 times [2024-09-18 16:42:53,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 16:42:53,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689398503] [2024-09-18 16:42:53,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:53,107 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-18 16:42:53,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 16:42:53,109 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-18 16:42:53,110 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-18 16:42:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:53,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-18 16:42:53,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:42:53,474 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-18 16:42:53,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-18 16:42:53,484 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-18 16:42:53,565 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-18 16:42:53,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 16:42:53,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 16:42:53,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689398503] [2024-09-18 16:42:53,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689398503] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 16:42:53,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 16:42:53,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-09-18 16:42:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127746138] [2024-09-18 16:42:53,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 16:42:53,567 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-18 16:42:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 16:42:53,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-18 16:42:53,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-09-18 16:42:53,570 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-18 16:42:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:42:53,946 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-09-18 16:42:53,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-18 16:42:53,947 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-18 16:42:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:42:53,949 INFO L225 Difference]: With dead ends: 66 [2024-09-18 16:42:53,950 INFO L226 Difference]: Without dead ends: 56 [2024-09-18 16:42:53,950 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-09-18 16:42:53,951 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.3s IncrementalHoareTripleChecker+Time [2024-09-18 16:42:53,954 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.3s Time] [2024-09-18 16:42:53,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-18 16:42:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-09-18 16:42:53,973 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-18 16:42:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-09-18 16:42:53,975 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 31 [2024-09-18 16:42:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:42:53,975 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-09-18 16:42:53,975 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-18 16:42:53,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-09-18 16:42:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-18 16:42:53,977 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:42:53,977 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-18 16:42:53,981 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-09-18 16:42:54,179 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-18 16:42:54,180 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:42:54,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:54,180 INFO L85 PathProgramCache]: Analyzing trace with hash 757009592, now seen corresponding path program 1 times [2024-09-18 16:42:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 16:42:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716847895] [2024-09-18 16:42:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:54,181 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-18 16:42:54,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 16:42:54,186 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-18 16:42:54,188 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-18 16:42:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:54,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-18 16:42:54,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:42:54,914 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-18 16:42:54,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 16:42:55,503 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-18 16:42:55,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 16:42:55,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716847895] [2024-09-18 16:42:55,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716847895] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 16:42:55,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 16:42:55,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2024-09-18 16:42:55,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844311057] [2024-09-18 16:42:55,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 16:42:55,505 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-18 16:42:55,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 16:42:55,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-18 16:42:55,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-09-18 16:42:55,507 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-18 16:42:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:42:57,435 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2024-09-18 16:42:57,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-18 16:42:57,437 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-18 16:42:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:42:57,440 INFO L225 Difference]: With dead ends: 108 [2024-09-18 16:42:57,440 INFO L226 Difference]: Without dead ends: 106 [2024-09-18 16:42:57,441 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2024-09-18 16:42:57,443 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-09-18 16:42:57,444 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 441 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-18 16:42:57,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-18 16:42:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2024-09-18 16:42:57,489 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-18 16:42:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2024-09-18 16:42:57,493 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 43 [2024-09-18 16:42:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:42:57,494 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2024-09-18 16:42:57,494 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-18 16:42:57,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2024-09-18 16:42:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-18 16:42:57,497 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:42:57,497 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-18 16:42:57,503 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-09-18 16:42:57,701 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-18 16:42:57,702 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:42:57,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:42:57,702 INFO L85 PathProgramCache]: Analyzing trace with hash -920124993, now seen corresponding path program 1 times [2024-09-18 16:42:57,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 16:42:57,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673184360] [2024-09-18 16:42:57,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:42:57,703 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-18 16:42:57,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 16:42:57,706 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-18 16:42:57,707 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-18 16:42:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:42:57,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-18 16:42:57,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:42:58,929 INFO L349 Elim1Store]: treesize reduction 80, result has 41.6 percent of original size [2024-09-18 16:42:58,929 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-18 16:42:59,193 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-18 16:42:59,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 16:43:12,442 INFO L349 Elim1Store]: treesize reduction 15, result has 59.5 percent of original size [2024-09-18 16:43:12,443 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-18 16:43:13,846 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-18 16:43:13,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 16:43:13,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673184360] [2024-09-18 16:43:13,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673184360] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 16:43:13,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 16:43:13,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2024-09-18 16:43:13,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599111032] [2024-09-18 16:43:13,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 16:43:13,847 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-18 16:43:13,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 16:43:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-18 16:43:13,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=951, Unknown=3, NotChecked=0, Total=1056 [2024-09-18 16:43:13,849 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-18 16:43:29,334 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-18 16:43:31,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-18 16:43:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:43:33,723 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2024-09-18 16:43:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-18 16:43:33,724 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-18 16:43:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:43:33,726 INFO L225 Difference]: With dead ends: 165 [2024-09-18 16:43:33,726 INFO L226 Difference]: Without dead ends: 163 [2024-09-18 16:43:33,730 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=257, Invalid=2494, Unknown=5, NotChecked=0, Total=2756 [2024-09-18 16:43:33,731 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 85 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-09-18 16:43:33,734 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 632 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 671 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2024-09-18 16:43:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-09-18 16:43:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2024-09-18 16:43:33,786 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-18 16:43:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 180 transitions. [2024-09-18 16:43:33,789 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 180 transitions. Word has length 46 [2024-09-18 16:43:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:43:33,790 INFO L474 AbstractCegarLoop]: Abstraction has 146 states and 180 transitions. [2024-09-18 16:43:33,790 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-18 16:43:33,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:43:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 180 transitions. [2024-09-18 16:43:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-18 16:43:33,793 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:43:33,794 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-18 16:43:33,798 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-18 16:43:33,994 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-18 16:43:33,994 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:43:33,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:43:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash 986908330, now seen corresponding path program 1 times [2024-09-18 16:43:33,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 16:43:33,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441972157] [2024-09-18 16:43:33,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:43:33,996 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-18 16:43:33,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 16:43:33,998 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-18 16:43:33,999 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-18 16:43:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:43:34,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-18 16:43:34,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:43:34,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-18 16:43:34,603 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-18 16:43:34,820 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-18 16:43:34,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 16:43:35,905 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2024-09-18 16:43:35,905 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-18 16:43:36,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 16:43:36,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441972157] [2024-09-18 16:43:36,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441972157] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 16:43:36,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [128814671] [2024-09-18 16:43:36,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:43:36,887 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-18 16:43:36,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-18 16:43:36,890 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-18 16:43:36,890 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-18 16:43:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:43:36,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-18 16:43:37,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:43:37,012 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-18 16:43:41,399 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-18 16:45:15,982 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-18 16:45:15,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 16:45:51,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [128814671] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 16:45:51,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 16:45:51,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2024-09-18 16:45:51,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323033919] [2024-09-18 16:45:51,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 16:45:51,828 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-18 16:45:51,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 16:45:51,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-18 16:45:51,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=771, Unknown=25, NotChecked=56, Total=930 [2024-09-18 16:45:51,829 INFO L87 Difference]: Start difference. First operand 146 states and 180 transitions. Second operand has 24 states, 19 states have (on average 2.789473684210526) internal successors, (53), 20 states have internal predecessors, (53), 9 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2024-09-18 16:46:28,768 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-18 16:46:32,794 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-18 16:46:36,807 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-18 16:46:40,818 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-18 16:46:44,932 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-18 16:46:57,405 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]