./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec.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 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec.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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 19:56:25,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:56:25,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:56:25,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:56:25,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:56:25,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:56:25,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:56:25,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:56:25,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:56:25,423 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:56:25,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:56:25,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:56:25,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:56:25,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:56:25,424 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:56:25,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:56:25,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:56:25,425 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:56:25,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:56:25,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:56:25,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:56:25,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:56:25,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:56:25,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:56:25,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:56:25,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:56:25,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:56:25,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:56:25,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:56:25,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:56:25,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:56:25,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:56:25,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:56:25,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:56:25,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:56:25,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:56:25,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:56:25,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:56:25,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:56:25,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:56:25,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:56:25,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:56:25,445 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a 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.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 19:56:25,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:56:25,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:56:25,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:56:25,748 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:56:25,749 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:56:25,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-09-12 19:56:27,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:56:27,284 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:56:27,284 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-09-12 19:56:27,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/9cc23fce0/cf04253fe01d4575a1052507c42e11a6/FLAG9c4a56d9b [2024-09-12 19:56:27,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/9cc23fce0/cf04253fe01d4575a1052507c42e11a6 [2024-09-12 19:56:27,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:56:27,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:56:27,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:56:27,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:56:27,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:56:27,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5404566c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27, skipping insertion in model container [2024-09-12 19:56:27,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:56:27,434 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2024-09-12 19:56:27,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:56:27,453 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:56:27,461 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2024-09-12 19:56:27,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:56:27,478 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:56:27,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27 WrapperNode [2024-09-12 19:56:27,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:56:27,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:56:27,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:56:27,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:56:27,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,501 INFO L138 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:56:27,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:56:27,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:56:27,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:56:27,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:56:27,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,526 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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-12 19:56:27,526 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:56:27,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:56:27,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:56:27,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:56:27,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (1/1) ... [2024-09-12 19:56:27,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:56:27,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:27,569 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-12 19:56:27,571 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-12 19:56:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:56:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 19:56:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 19:56:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:56:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:56:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:56:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 19:56:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-12 19:56:27,613 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-12 19:56:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:56:27,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:56:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-12 19:56:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:56:27,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:56:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 19:56:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 19:56:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-12 19:56:27,615 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-12 19:56:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 19:56:27,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 19:56:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 19:56:27,690 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:56:27,692 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:56:27,891 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-09-12 19:56:27,891 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:56:27,925 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:56:27,925 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 19:56:27,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:56:27 BoogieIcfgContainer [2024-09-12 19:56:27,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:56:27,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:56:27,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:56:27,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:56:27,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:56:27" (1/3) ... [2024-09-12 19:56:27,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10dd3714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:56:27, skipping insertion in model container [2024-09-12 19:56:27,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:27" (2/3) ... [2024-09-12 19:56:27,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10dd3714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:56:27, skipping insertion in model container [2024-09-12 19:56:27,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:56:27" (3/3) ... [2024-09-12 19:56:27,935 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-09-12 19:56:27,949 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:56:27,949 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-09-12 19:56:28,001 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:56:28,007 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;@1d3b9885, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:56:28,007 INFO L337 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-09-12 19:56:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 35 states have internal predecessors, (39), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-12 19:56:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 19:56:28,016 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:28,016 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:28,017 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:28,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:28,023 INFO L85 PathProgramCache]: Analyzing trace with hash -850927417, now seen corresponding path program 1 times [2024-09-12 19:56:28,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:28,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807941403] [2024-09-12 19:56:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:28,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:28,150 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:28,161 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:28,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:28,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807941403] [2024-09-12 19:56:28,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807941403] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:28,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:28,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 19:56:28,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687066076] [2024-09-12 19:56:28,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:28,174 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:56:28,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:28,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:56:28,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:56:28,195 INFO L87 Difference]: Start difference. First operand has 51 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 35 states have internal predecessors, (39), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:56:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:28,277 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2024-09-12 19:56:28,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:56:28,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-09-12 19:56:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:28,284 INFO L225 Difference]: With dead ends: 96 [2024-09-12 19:56:28,284 INFO L226 Difference]: Without dead ends: 47 [2024-09-12 19:56:28,288 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:56:28,292 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:28,293 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 24 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:56:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-12 19:56:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-12 19:56:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 33 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 19:56:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-09-12 19:56:28,336 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 16 [2024-09-12 19:56:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:28,336 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-09-12 19:56:28,336 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:56:28,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-09-12 19:56:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 19:56:28,338 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:28,338 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:28,338 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 19:56:28,338 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:28,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:28,339 INFO L85 PathProgramCache]: Analyzing trace with hash -170869047, now seen corresponding path program 1 times [2024-09-12 19:56:28,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:28,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136938832] [2024-09-12 19:56:28,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:28,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:28,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:28,529 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:28,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:28,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:28,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136938832] [2024-09-12 19:56:28,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136938832] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:28,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:28,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:56:28,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203133105] [2024-09-12 19:56:28,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:28,597 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:56:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:28,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:56:28,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:56:28,599 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:56:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:28,767 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2024-09-12 19:56:28,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:56:28,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-09-12 19:56:28,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:28,768 INFO L225 Difference]: With dead ends: 47 [2024-09-12 19:56:28,769 INFO L226 Difference]: Without dead ends: 45 [2024-09-12 19:56:28,770 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:56:28,770 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:28,771 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:56:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-12 19:56:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-12 19:56:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 19:56:28,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-09-12 19:56:28,779 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 16 [2024-09-12 19:56:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:28,780 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-09-12 19:56:28,780 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:56:28,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-09-12 19:56:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 19:56:28,781 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:28,781 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:28,781 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:56:28,782 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:28,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash -773367852, now seen corresponding path program 1 times [2024-09-12 19:56:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:28,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073743888] [2024-09-12 19:56:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:28,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:28,936 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:28,945 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073743888] [2024-09-12 19:56:28,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073743888] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:28,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:28,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 19:56:28,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77261602] [2024-09-12 19:56:28,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:28,950 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 19:56:28,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 19:56:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-12 19:56:28,951 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 19:56:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:29,163 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-09-12 19:56:29,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:56:29,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-12 19:56:29,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:29,166 INFO L225 Difference]: With dead ends: 72 [2024-09-12 19:56:29,166 INFO L226 Difference]: Without dead ends: 67 [2024-09-12 19:56:29,166 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 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-12 19:56:29,167 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 76 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:29,168 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 58 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:56:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-12 19:56:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-09-12 19:56:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 44 states have internal predecessors, (51), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 19:56:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2024-09-12 19:56:29,180 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 24 [2024-09-12 19:56:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:29,180 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2024-09-12 19:56:29,180 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 19:56:29,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2024-09-12 19:56:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 19:56:29,181 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:29,182 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:29,182 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 19:56:29,182 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:29,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:29,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1665812104, now seen corresponding path program 1 times [2024-09-12 19:56:29,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:29,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218655125] [2024-09-12 19:56:29,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:29,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:56:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:29,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:29,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218655125] [2024-09-12 19:56:29,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218655125] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:29,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:29,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 19:56:29,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912722967] [2024-09-12 19:56:29,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:29,294 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 19:56:29,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:29,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 19:56:29,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:56:29,295 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:29,522 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2024-09-12 19:56:29,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 19:56:29,522 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-12 19:56:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:29,525 INFO L225 Difference]: With dead ends: 99 [2024-09-12 19:56:29,525 INFO L226 Difference]: Without dead ends: 98 [2024-09-12 19:56:29,525 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-09-12 19:56:29,526 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 92 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:29,526 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 58 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:56:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-12 19:56:29,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2024-09-12 19:56:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 58 states have internal predecessors, (67), 19 states have call successors, (19), 9 states have call predecessors, (19), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-12 19:56:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2024-09-12 19:56:29,549 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 28 [2024-09-12 19:56:29,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:29,549 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2024-09-12 19:56:29,549 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:29,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2024-09-12 19:56:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 19:56:29,550 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:29,550 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:29,551 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 19:56:29,551 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:29,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:29,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1665811912, now seen corresponding path program 1 times [2024-09-12 19:56:29,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:29,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099039323] [2024-09-12 19:56:29,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:29,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,600 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,602 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:56:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:29,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:29,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099039323] [2024-09-12 19:56:29,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099039323] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:29,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:29,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:56:29,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231545041] [2024-09-12 19:56:29,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:29,606 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:56:29,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:29,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:56:29,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:56:29,607 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:29,744 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2024-09-12 19:56:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:56:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-12 19:56:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:29,746 INFO L225 Difference]: With dead ends: 96 [2024-09-12 19:56:29,746 INFO L226 Difference]: Without dead ends: 94 [2024-09-12 19:56:29,747 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:56:29,747 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 78 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:29,748 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 47 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:56:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-12 19:56:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2024-09-12 19:56:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 58 states have internal predecessors, (63), 19 states have call successors, (19), 9 states have call predecessors, (19), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-12 19:56:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2024-09-12 19:56:29,762 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 28 [2024-09-12 19:56:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:29,762 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2024-09-12 19:56:29,762 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:29,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2024-09-12 19:56:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 19:56:29,763 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:29,763 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:29,763 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 19:56:29,764 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:29,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash 100567741, now seen corresponding path program 1 times [2024-09-12 19:56:29,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:29,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971603969] [2024-09-12 19:56:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:29,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,822 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:56:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:29,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:29,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971603969] [2024-09-12 19:56:29,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971603969] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:29,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:29,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 19:56:29,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603003522] [2024-09-12 19:56:29,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:29,826 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 19:56:29,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:29,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 19:56:29,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-12 19:56:29,827 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 19:56:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:29,948 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-09-12 19:56:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 19:56:29,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-09-12 19:56:29,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:29,949 INFO L225 Difference]: With dead ends: 86 [2024-09-12 19:56:29,949 INFO L226 Difference]: Without dead ends: 85 [2024-09-12 19:56:29,950 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:56:29,950 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:29,951 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 38 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:56:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-09-12 19:56:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-09-12 19:56:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 57 states have internal predecessors, (60), 19 states have call successors, (19), 9 states have call predecessors, (19), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-12 19:56:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2024-09-12 19:56:29,962 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 29 [2024-09-12 19:56:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:29,963 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2024-09-12 19:56:29,963 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 19:56:29,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2024-09-12 19:56:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 19:56:29,964 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:29,964 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 19:56:29,964 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 19:56:29,964 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:29,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1798527584, now seen corresponding path program 1 times [2024-09-12 19:56:29,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:29,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446526899] [2024-09-12 19:56:29,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:29,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:30,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:30,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:30,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:30,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:56:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:30,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446526899] [2024-09-12 19:56:30,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446526899] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:30,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:30,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-12 19:56:30,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942133997] [2024-09-12 19:56:30,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:30,129 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 19:56:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:30,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 19:56:30,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:56:30,130 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:30,470 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2024-09-12 19:56:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 19:56:30,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-09-12 19:56:30,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:30,472 INFO L225 Difference]: With dead ends: 98 [2024-09-12 19:56:30,473 INFO L226 Difference]: Without dead ends: 96 [2024-09-12 19:56:30,473 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-09-12 19:56:30,474 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:30,474 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 90 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:56:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-12 19:56:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2024-09-12 19:56:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 60 states have internal predecessors, (63), 19 states have call successors, (19), 10 states have call predecessors, (19), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-12 19:56:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2024-09-12 19:56:30,502 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 36 [2024-09-12 19:56:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:30,503 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2024-09-12 19:56:30,503 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:30,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2024-09-12 19:56:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 19:56:30,504 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:30,504 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 19:56:30,504 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 19:56:30,504 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:30,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:30,505 INFO L85 PathProgramCache]: Analyzing trace with hash -231581786, now seen corresponding path program 1 times [2024-09-12 19:56:30,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:30,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712028523] [2024-09-12 19:56:30,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:30,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:30,654 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:30,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:30,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:30,671 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:56:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:30,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:30,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712028523] [2024-09-12 19:56:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712028523] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:56:30,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352902692] [2024-09-12 19:56:30,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:30,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:30,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:30,679 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-12 19:56:30,681 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-12 19:56:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:30,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 19:56:30,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:30,860 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:56:30,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352902692] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:30,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:56:30,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2024-09-12 19:56:30,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53262660] [2024-09-12 19:56:30,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:30,861 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 19:56:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:30,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 19:56:30,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-09-12 19:56:30,862 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:31,121 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2024-09-12 19:56:31,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 19:56:31,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-09-12 19:56:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:31,123 INFO L225 Difference]: With dead ends: 123 [2024-09-12 19:56:31,123 INFO L226 Difference]: Without dead ends: 120 [2024-09-12 19:56:31,124 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-09-12 19:56:31,124 INFO L434 NwaCegarLoop]: 63 mSDtfsCounter, 35 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:31,125 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 411 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:56:31,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-09-12 19:56:31,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 107. [2024-09-12 19:56:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 76 states have internal predecessors, (82), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-12 19:56:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2024-09-12 19:56:31,150 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 36 [2024-09-12 19:56:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:31,151 INFO L474 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2024-09-12 19:56:31,151 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:31,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2024-09-12 19:56:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 19:56:31,153 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:31,153 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:31,171 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 19:56:31,353 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:31,355 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:31,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1670188378, now seen corresponding path program 1 times [2024-09-12 19:56:31,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:31,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223411548] [2024-09-12 19:56:31,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:31,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:31,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:31,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:31,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:31,453 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:56:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:31,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-12 19:56:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:56:31,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223411548] [2024-09-12 19:56:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223411548] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:56:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092136145] [2024-09-12 19:56:31,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:31,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:31,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:31,461 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-12 19:56:31,462 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-12 19:56:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:31,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 19:56:31,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:56:31,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:56:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:56:31,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092136145] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:56:31,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:56:31,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-09-12 19:56:31,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243227665] [2024-09-12 19:56:31,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:56:31,702 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-12 19:56:31,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:31,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-12 19:56:31,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-09-12 19:56:31,703 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 16 states have internal predecessors, (47), 9 states have call successors, (17), 8 states have call predecessors, (17), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-12 19:56:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:32,333 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2024-09-12 19:56:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 19:56:32,333 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 16 states have internal predecessors, (47), 9 states have call successors, (17), 8 states have call predecessors, (17), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 40 [2024-09-12 19:56:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:32,334 INFO L225 Difference]: With dead ends: 139 [2024-09-12 19:56:32,334 INFO L226 Difference]: Without dead ends: 137 [2024-09-12 19:56:32,335 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=1011, Unknown=0, NotChecked=0, Total=1260 [2024-09-12 19:56:32,335 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 135 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:32,336 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 185 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 19:56:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-09-12 19:56:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2024-09-12 19:56:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.144927536231884) internal successors, (79), 74 states have internal predecessors, (79), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-12 19:56:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2024-09-12 19:56:32,363 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 40 [2024-09-12 19:56:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:32,363 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2024-09-12 19:56:32,363 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 16 states have internal predecessors, (47), 9 states have call successors, (17), 8 states have call predecessors, (17), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-12 19:56:32,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2024-09-12 19:56:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 19:56:32,366 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:32,367 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:32,379 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 19:56:32,567 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:32,568 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:32,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:32,568 INFO L85 PathProgramCache]: Analyzing trace with hash 236226277, now seen corresponding path program 1 times [2024-09-12 19:56:32,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:32,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621062758] [2024-09-12 19:56:32,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:32,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:32,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:32,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:32,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:32,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:56:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:32,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-12 19:56:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:56:32,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:32,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621062758] [2024-09-12 19:56:32,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621062758] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:56:32,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41024942] [2024-09-12 19:56:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:32,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:32,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:32,652 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-12 19:56:32,653 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-12 19:56:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:32,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 19:56:32,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:56:32,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:56:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:56:32,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41024942] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:56:32,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:56:32,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2024-09-12 19:56:32,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212298529] [2024-09-12 19:56:32,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:56:32,821 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 19:56:32,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:32,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 19:56:32,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-09-12 19:56:32,822 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 12 states have internal predecessors, (44), 6 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-12 19:56:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:33,301 INFO L93 Difference]: Finished difference Result 277 states and 364 transitions. [2024-09-12 19:56:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-12 19:56:33,302 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 12 states have internal predecessors, (44), 6 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 41 [2024-09-12 19:56:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:33,304 INFO L225 Difference]: With dead ends: 277 [2024-09-12 19:56:33,304 INFO L226 Difference]: Without dead ends: 276 [2024-09-12 19:56:33,304 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=815, Unknown=0, NotChecked=0, Total=1056 [2024-09-12 19:56:33,305 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 202 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:33,306 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 99 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:56:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-09-12 19:56:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 213. [2024-09-12 19:56:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 141 states have (on average 1.1560283687943262) internal successors, (163), 152 states have internal predecessors, (163), 54 states have call successors, (54), 18 states have call predecessors, (54), 16 states have return successors, (51), 42 states have call predecessors, (51), 51 states have call successors, (51) [2024-09-12 19:56:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 268 transitions. [2024-09-12 19:56:33,338 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 268 transitions. Word has length 41 [2024-09-12 19:56:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:33,338 INFO L474 AbstractCegarLoop]: Abstraction has 213 states and 268 transitions. [2024-09-12 19:56:33,339 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 12 states have internal predecessors, (44), 6 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-12 19:56:33,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 268 transitions. [2024-09-12 19:56:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-12 19:56:33,340 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:33,340 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:33,352 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 19:56:33,540 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 19:56:33,541 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:33,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:33,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1556751203, now seen corresponding path program 1 times [2024-09-12 19:56:33,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:33,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169050340] [2024-09-12 19:56:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:33,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:33,696 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:33,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:33,708 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:33,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:56:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:33,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-12 19:56:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:33,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 19:56:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:56:33,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:33,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169050340] [2024-09-12 19:56:33,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169050340] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:56:33,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451557435] [2024-09-12 19:56:33,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:33,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:33,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:33,737 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:56:33,738 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 19:56:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:33,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 19:56:33,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:33,837 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-12 19:56:33,907 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-12 19:56:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:33,935 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:56:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451557435] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:33,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:56:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 14 [2024-09-12 19:56:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952768472] [2024-09-12 19:56:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:33,936 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 19:56:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:33,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 19:56:33,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-09-12 19:56:33,937 INFO L87 Difference]: Start difference. First operand 213 states and 268 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 19:56:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:34,034 INFO L93 Difference]: Finished difference Result 268 states and 330 transitions. [2024-09-12 19:56:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 19:56:34,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2024-09-12 19:56:34,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:34,036 INFO L225 Difference]: With dead ends: 268 [2024-09-12 19:56:34,036 INFO L226 Difference]: Without dead ends: 117 [2024-09-12 19:56:34,038 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-09-12 19:56:34,038 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:34,038 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 205 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:56:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-09-12 19:56:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2024-09-12 19:56:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 73 states have internal predecessors, (77), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-12 19:56:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2024-09-12 19:56:34,054 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 45 [2024-09-12 19:56:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:34,055 INFO L474 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2024-09-12 19:56:34,055 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 19:56:34,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2024-09-12 19:56:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-12 19:56:34,055 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:34,056 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:34,084 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 19:56:34,256 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:34,256 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:34,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash 191191069, now seen corresponding path program 1 times [2024-09-12 19:56:34,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:34,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657335169] [2024-09-12 19:56:34,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:34,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:34,367 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:34,369 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:34,377 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:34,392 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:56:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:34,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-12 19:56:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:34,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 19:56:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:56:34,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:34,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657335169] [2024-09-12 19:56:34,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657335169] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:56:34,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883011943] [2024-09-12 19:56:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:34,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:34,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:34,402 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:56:34,404 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 19:56:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:34,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-12 19:56:34,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:34,466 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-12 19:56:34,677 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-12 19:56:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:34,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:56:38,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883011943] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:56:38,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:56:38,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2024-09-12 19:56:38,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499501352] [2024-09-12 19:56:38,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:56:38,816 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-12 19:56:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:38,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-12 19:56:38,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-09-12 19:56:38,817 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 20 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 7 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-12 19:56:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:39,251 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2024-09-12 19:56:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-12 19:56:39,252 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 7 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 45 [2024-09-12 19:56:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:39,253 INFO L225 Difference]: With dead ends: 117 [2024-09-12 19:56:39,253 INFO L226 Difference]: Without dead ends: 67 [2024-09-12 19:56:39,254 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2024-09-12 19:56:39,254 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 81 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:39,255 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 75 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:56:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-12 19:56:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-09-12 19:56:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 14 states have call successors, (14), 11 states have call predecessors, (14), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 19:56:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-09-12 19:56:39,265 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 45 [2024-09-12 19:56:39,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:39,265 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-09-12 19:56:39,265 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 7 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-12 19:56:39,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-09-12 19:56:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-09-12 19:56:39,266 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:39,267 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:39,281 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 19:56:39,467 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-12 19:56:39,468 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:39,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:39,468 INFO L85 PathProgramCache]: Analyzing trace with hash -10058961, now seen corresponding path program 2 times [2024-09-12 19:56:39,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:39,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458880047] [2024-09-12 19:56:39,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:39,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:39,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:39,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:56:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:39,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:56:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:39,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:56:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:39,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-12 19:56:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:39,707 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-09-12 19:56:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:39,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-12 19:56:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:39,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-12 19:56:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-12 19:56:39,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:39,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458880047] [2024-09-12 19:56:39,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458880047] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:56:39,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600159575] [2024-09-12 19:56:39,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:56:39,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:39,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:39,714 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:56:39,715 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 19:56:39,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:56:39,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:56:39,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 19:56:39,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-09-12 19:56:39,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:56:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-09-12 19:56:40,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600159575] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:56:40,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:56:40,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 27 [2024-09-12 19:56:40,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922870416] [2024-09-12 19:56:40,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:56:40,010 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-12 19:56:40,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:40,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-12 19:56:40,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2024-09-12 19:56:40,011 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 20 states have internal predecessors, (76), 12 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-09-12 19:56:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:40,540 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2024-09-12 19:56:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-12 19:56:40,540 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 20 states have internal predecessors, (76), 12 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) Word has length 77 [2024-09-12 19:56:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:40,541 INFO L225 Difference]: With dead ends: 75 [2024-09-12 19:56:40,541 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 19:56:40,542 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=589, Invalid=2273, Unknown=0, NotChecked=0, Total=2862 [2024-09-12 19:56:40,543 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 129 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:40,543 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 111 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:56:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 19:56:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 19:56:40,543 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-12 19:56:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 19:56:40,544 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2024-09-12 19:56:40,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:40,544 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 19:56:40,544 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 20 states have internal predecessors, (76), 12 states have call successors, (26), 9 states have call predecessors, (26), 1 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-09-12 19:56:40,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 19:56:40,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 19:56:40,547 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2024-09-12 19:56:40,547 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2024-09-12 19:56:40,547 INFO L785 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 7 remaining) [2024-09-12 19:56:40,547 INFO L785 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2024-09-12 19:56:40,547 INFO L785 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2024-09-12 19:56:40,547 INFO L785 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2024-09-12 19:56:40,548 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-09-12 19:56:40,560 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-12 19:56:40,751 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-12 19:56:40,754 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:40,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 19:56:44,888 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 19:56:44,900 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.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-12 19:56:44,903 INFO L158 Benchmark]: Toolchain (without parser) took 17593.98ms. Allocated memory was 107.0MB in the beginning and 237.0MB in the end (delta: 130.0MB). Free memory was 73.9MB in the beginning and 168.4MB in the end (delta: -94.5MB). Peak memory consumption was 135.6MB. Max. memory is 16.1GB. [2024-09-12 19:56:44,903 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 29.3MB in the beginning and 29.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:56:44,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.78ms. Allocated memory is still 107.0MB. Free memory was 73.6MB in the beginning and 62.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 19:56:44,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.93ms. Allocated memory is still 107.0MB. Free memory was 62.0MB in the beginning and 60.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:56:44,904 INFO L158 Benchmark]: Boogie Preprocessor took 38.33ms. Allocated memory is still 107.0MB. Free memory was 60.8MB in the beginning and 58.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 19:56:44,904 INFO L158 Benchmark]: RCFGBuilder took 385.10ms. Allocated memory is still 107.0MB. Free memory was 58.9MB in the beginning and 75.7MB in the end (delta: -16.8MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-09-12 19:56:44,904 INFO L158 Benchmark]: TraceAbstraction took 16975.59ms. Allocated memory was 107.0MB in the beginning and 237.0MB in the end (delta: 130.0MB). Free memory was 75.3MB in the beginning and 168.4MB in the end (delta: -93.1MB). Peak memory consumption was 134.9MB. Max. memory is 16.1GB. [2024-09-12 19:56:44,905 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.16ms. Allocated memory is still 54.5MB. Free memory was 29.3MB in the beginning and 29.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.78ms. Allocated memory is still 107.0MB. Free memory was 73.6MB in the beginning and 62.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.93ms. Allocated memory is still 107.0MB. Free memory was 62.0MB in the beginning and 60.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.33ms. Allocated memory is still 107.0MB. Free memory was 60.8MB in the beginning and 58.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.10ms. Allocated memory is still 107.0MB. Free memory was 58.9MB in the beginning and 75.7MB in the end (delta: -16.8MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16975.59ms. Allocated memory was 107.0MB in the beginning and 237.0MB in the end (delta: 130.0MB). Free memory was 75.3MB in the beginning and 168.4MB in the end (delta: -93.1MB). Peak memory consumption was 134.9MB. 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: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - 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, 51 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1105 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1062 mSDsluCounter, 1430 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1207 mSDsCounter, 407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3836 IncrementalHoareTripleChecker+Invalid, 4243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 407 mSolverCounterUnsat, 223 mSDtfsCounter, 3836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 770 GetRequests, 520 SyntacticMatches, 6 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=10, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 164 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 881 ConstructedInterpolants, 18 QuantifiedInterpolants, 2345 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1157 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 296/455 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 7 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-12 19:56:44,932 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.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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 19:56:46,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:56:46,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-12 19:56:46,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:56:46,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:56:46,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:56:46,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:56:46,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:56:46,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:56:46,871 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:56:46,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:56:46,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:56:46,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:56:46,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:56:46,874 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:56:46,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:56:46,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:56:46,875 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:56:46,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:56:46,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:56:46,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:56:46,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:56:46,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:56:46,880 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-12 19:56:46,880 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-12 19:56:46,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:56:46,881 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-12 19:56:46,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:56:46,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:56:46,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:56:46,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:56:46,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:56:46,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:56:46,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:56:46,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:56:46,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:56:46,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:56:46,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:56:46,883 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-12 19:56:46,883 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-12 19:56:46,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:56:46,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:56:46,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:56:46,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:56:46,884 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-12 19:56:46,884 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a 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.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 19:56:47,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:56:47,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:56:47,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:56:47,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:56:47,205 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:56:47,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-09-12 19:56:48,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:56:48,809 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:56:48,810 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-09-12 19:56:48,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/edb02b19b/9e301bb062e24aeb95dc6dfaa440bffe/FLAG415b4fafc [2024-09-12 19:56:48,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/edb02b19b/9e301bb062e24aeb95dc6dfaa440bffe [2024-09-12 19:56:48,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:56:48,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:56:48,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:56:48,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:56:48,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:56:48,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:56:48" (1/1) ... [2024-09-12 19:56:48,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5730ad58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:48, skipping insertion in model container [2024-09-12 19:56:48,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:56:48" (1/1) ... [2024-09-12 19:56:48,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:56:48,960 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2024-09-12 19:56:48,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:56:48,988 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:56:48,996 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2024-09-12 19:56:49,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:56:49,015 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:56:49,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49 WrapperNode [2024-09-12 19:56:49,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:56:49,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:56:49,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:56:49,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:56:49,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (1/1) ... [2024-09-12 19:56:49,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (1/1) ... [2024-09-12 19:56:49,034 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:56:49,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:56:49,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:56:49,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:56:49,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:56:49,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (1/1) ... [2024-09-12 19:56:49,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (1/1) ... [2024-09-12 19:56:49,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (1/1) ... [2024-09-12 19:56:49,065 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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-12 19:56:49,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (1/1) ... [2024-09-12 19:56:49,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (1/1) ... [2024-09-12 19:56:49,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (1/1) ... [2024-09-12 19:56:49,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (1/1) ... [2024-09-12 19:56:49,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (1/1) ... [2024-09-12 19:56:49,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (1/1) ... [2024-09-12 19:56:49,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:56:49,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:56:49,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:56:49,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:56:49,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (1/1) ... [2024-09-12 19:56:49,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:56:49,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:49,115 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-12 19:56:49,119 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-12 19:56:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:56:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-12 19:56:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-12 19:56:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 19:56:49,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 19:56:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:56:49,157 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:56:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-12 19:56:49,157 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-12 19:56:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:56:49,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:56:49,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-12 19:56:49,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-12 19:56:49,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-12 19:56:49,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:56:49,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:56:49,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-12 19:56:49,174 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-12 19:56:49,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 19:56:49,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 19:56:49,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 19:56:49,292 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:56:49,294 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:56:49,514 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-12 19:56:49,514 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:56:49,548 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:56:49,549 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 19:56:49,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:56:49 BoogieIcfgContainer [2024-09-12 19:56:49,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:56:49,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:56:49,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:56:49,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:56:49,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:56:48" (1/3) ... [2024-09-12 19:56:49,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab1d278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:56:49, skipping insertion in model container [2024-09-12 19:56:49,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:49" (2/3) ... [2024-09-12 19:56:49,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab1d278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:56:49, skipping insertion in model container [2024-09-12 19:56:49,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:56:49" (3/3) ... [2024-09-12 19:56:49,557 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-09-12 19:56:49,573 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:56:49,574 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-09-12 19:56:49,628 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:56:49,633 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;@1960c291, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:56:49,634 INFO L337 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-09-12 19:56:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 35 states have internal predecessors, (39), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-12 19:56:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 19:56:49,643 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:49,644 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:49,645 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:49,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash -850927417, now seen corresponding path program 1 times [2024-09-12 19:56:49,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:56:49,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519774087] [2024-09-12 19:56:49,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:49,659 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-12 19:56:49,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:56:49,664 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-12 19:56:49,669 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-12 19:56:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:49,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-12 19:56:49,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:49,760 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:56:49,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:56:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519774087] [2024-09-12 19:56:49,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519774087] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:49,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:49,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:56:49,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042710896] [2024-09-12 19:56:49,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:49,769 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 19:56:49,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:56:49,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 19:56:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 19:56:49,789 INFO L87 Difference]: Start difference. First operand has 51 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 35 states have internal predecessors, (39), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:56:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:49,818 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2024-09-12 19:56:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 19:56:49,823 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-09-12 19:56:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:49,829 INFO L225 Difference]: With dead ends: 93 [2024-09-12 19:56:49,829 INFO L226 Difference]: Without dead ends: 44 [2024-09-12 19:56:49,831 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-12 19:56:49,837 INFO L434 NwaCegarLoop]: 49 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, 49 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-12 19:56:49,838 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:56:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-12 19:56:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-09-12 19:56:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 30 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 19:56:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2024-09-12 19:56:49,890 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 16 [2024-09-12 19:56:49,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:49,890 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-09-12 19:56:49,890 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:56:49,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2024-09-12 19:56:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 19:56:49,892 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:49,892 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:49,897 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-09-12 19:56:50,094 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-12 19:56:50,095 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:50,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash -170869047, now seen corresponding path program 1 times [2024-09-12 19:56:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:56:50,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761033734] [2024-09-12 19:56:50,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:50,096 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-12 19:56:50,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:56:50,098 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-12 19:56:50,098 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-12 19:56:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:50,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 19:56:50,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:50,225 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:56:50,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:56:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761033734] [2024-09-12 19:56:50,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761033734] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:50,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:50,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:56:50,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416030509] [2024-09-12 19:56:50,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:50,226 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:56:50,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:56:50,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:56:50,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:56:50,227 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:56:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:50,280 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-09-12 19:56:50,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:56:50,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-09-12 19:56:50,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:50,282 INFO L225 Difference]: With dead ends: 44 [2024-09-12 19:56:50,282 INFO L226 Difference]: Without dead ends: 43 [2024-09-12 19:56:50,283 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:56:50,283 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:50,284 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:56:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-12 19:56:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-12 19:56:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 19:56:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-12 19:56:50,297 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2024-09-12 19:56:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:50,298 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-12 19:56:50,298 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:56:50,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-12 19:56:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 19:56:50,299 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:50,299 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:50,304 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 (3)] Forceful destruction successful, exit code 0 [2024-09-12 19:56:50,499 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-12 19:56:50,500 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:50,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:50,500 INFO L85 PathProgramCache]: Analyzing trace with hash -773367852, now seen corresponding path program 1 times [2024-09-12 19:56:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:56:50,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177458340] [2024-09-12 19:56:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:50,501 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-12 19:56:50,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:56:50,504 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-12 19:56:50,505 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-12 19:56:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:50,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-12 19:56:50,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:50,825 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:56:50,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:56:50,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177458340] [2024-09-12 19:56:50,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177458340] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:50,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:50,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-12 19:56:50,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305870160] [2024-09-12 19:56:50,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:50,828 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 19:56:50,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:56:50,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 19:56:50,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:56:50,829 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:56:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:51,098 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-09-12 19:56:51,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 19:56:51,099 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-09-12 19:56:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:51,100 INFO L225 Difference]: With dead ends: 68 [2024-09-12 19:56:51,100 INFO L226 Difference]: Without dead ends: 63 [2024-09-12 19:56:51,101 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-09-12 19:56:51,102 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:51,102 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 253 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:56:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-12 19:56:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-09-12 19:56:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 19:56:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-09-12 19:56:51,117 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 24 [2024-09-12 19:56:51,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:51,118 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-09-12 19:56:51,118 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:56:51,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:51,118 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-09-12 19:56:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 19:56:51,119 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:51,119 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:51,134 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-09-12 19:56:51,321 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-12 19:56:51,322 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:51,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1665812104, now seen corresponding path program 1 times [2024-09-12 19:56:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:56:51,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70786141] [2024-09-12 19:56:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:51,324 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-12 19:56:51,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:56:51,326 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-12 19:56:51,327 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-12 19:56:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:51,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 19:56:51,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:51,396 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:56:51,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:56:51,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70786141] [2024-09-12 19:56:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70786141] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:51,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:51,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:56:51,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377046385] [2024-09-12 19:56:51,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:51,398 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:56:51,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:56:51,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:56:51,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:56:51,398 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:51,522 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2024-09-12 19:56:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:56:51,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-12 19:56:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:51,525 INFO L225 Difference]: With dead ends: 95 [2024-09-12 19:56:51,525 INFO L226 Difference]: Without dead ends: 94 [2024-09-12 19:56:51,525 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:56:51,526 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 36 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:51,529 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 217 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:56:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-12 19:56:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2024-09-12 19:56:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 19 states have call successors, (19), 9 states have call predecessors, (19), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-12 19:56:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2024-09-12 19:56:51,554 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 28 [2024-09-12 19:56:51,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:51,555 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2024-09-12 19:56:51,555 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:51,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2024-09-12 19:56:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 19:56:51,556 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:51,556 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:51,567 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-12 19:56:51,756 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-12 19:56:51,757 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:51,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash 100561783, now seen corresponding path program 1 times [2024-09-12 19:56:51,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:56:51,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824572127] [2024-09-12 19:56:51,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:51,758 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-12 19:56:51,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:56:51,763 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-12 19:56:51,769 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-12 19:56:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:51,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 19:56:51,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:51,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:56:51,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:56:51,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824572127] [2024-09-12 19:56:51,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824572127] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:51,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:51,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:56:51,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354806552] [2024-09-12 19:56:51,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:51,839 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:56:51,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:56:51,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:56:51,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:56:51,840 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:51,929 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2024-09-12 19:56:51,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:56:51,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-12 19:56:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:51,931 INFO L225 Difference]: With dead ends: 92 [2024-09-12 19:56:51,931 INFO L226 Difference]: Without dead ends: 91 [2024-09-12 19:56:51,931 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-12 19:56:51,932 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:51,932 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 161 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:56:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-09-12 19:56:51,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2024-09-12 19:56:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 19 states have call successors, (19), 9 states have call predecessors, (19), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-12 19:56:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-09-12 19:56:51,949 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 29 [2024-09-12 19:56:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:51,950 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-09-12 19:56:51,950 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:51,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-09-12 19:56:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 19:56:51,951 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:51,951 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 19:56:51,956 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 (6)] Forceful destruction successful, exit code 0 [2024-09-12 19:56:52,154 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-12 19:56:52,155 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:52,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1798527584, now seen corresponding path program 1 times [2024-09-12 19:56:52,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:56:52,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630899960] [2024-09-12 19:56:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:52,157 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-12 19:56:52,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:56:52,162 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-12 19:56:52,164 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-12 19:56:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:52,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-12 19:56:52,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:52,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:56:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:53,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:56:53,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630899960] [2024-09-12 19:56:53,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630899960] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:56:53,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:56:53,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 24 [2024-09-12 19:56:53,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483407751] [2024-09-12 19:56:53,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:56:53,229 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-12 19:56:53,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:56:53,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-12 19:56:53,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2024-09-12 19:56:53,230 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-12 19:56:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:55,032 INFO L93 Difference]: Finished difference Result 157 states and 198 transitions. [2024-09-12 19:56:55,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-12 19:56:55,033 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 36 [2024-09-12 19:56:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:55,034 INFO L225 Difference]: With dead ends: 157 [2024-09-12 19:56:55,034 INFO L226 Difference]: Without dead ends: 155 [2024-09-12 19:56:55,035 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=224, Invalid=1416, Unknown=0, NotChecked=0, Total=1640 [2024-09-12 19:56:55,036 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 79 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:55,036 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 573 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 19:56:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-09-12 19:56:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 121. [2024-09-12 19:56:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 86 states have internal predecessors, (92), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (27), 22 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-12 19:56:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 149 transitions. [2024-09-12 19:56:55,064 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 149 transitions. Word has length 36 [2024-09-12 19:56:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:55,064 INFO L474 AbstractCegarLoop]: Abstraction has 121 states and 149 transitions. [2024-09-12 19:56:55,065 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-12 19:56:55,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2024-09-12 19:56:55,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 19:56:55,066 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:55,066 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 19:56:55,070 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 (7)] Ended with exit code 0 [2024-09-12 19:56:55,269 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-12 19:56:55,270 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:55,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:55,270 INFO L85 PathProgramCache]: Analyzing trace with hash -231581786, now seen corresponding path program 1 times [2024-09-12 19:56:55,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:56:55,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362024004] [2024-09-12 19:56:55,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:55,271 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-12 19:56:55,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:56:55,274 INFO L229 MonitoredProcess]: Starting monitored process 8 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-12 19:56:55,275 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 (8)] Waiting until timeout for monitored process [2024-09-12 19:56:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:55,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-12 19:56:55,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:55,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:56:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:55,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:56:55,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362024004] [2024-09-12 19:56:55,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362024004] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:56:55,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:56:55,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2024-09-12 19:56:55,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837200632] [2024-09-12 19:56:55,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:56:55,996 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-12 19:56:55,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:56:55,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-12 19:56:55,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-09-12 19:56:55,997 INFO L87 Difference]: Start difference. First operand 121 states and 149 transitions. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 18 states have internal predecessors, (43), 6 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-12 19:56:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:57,147 INFO L93 Difference]: Finished difference Result 186 states and 237 transitions. [2024-09-12 19:56:57,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-12 19:56:57,148 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 18 states have internal predecessors, (43), 6 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 36 [2024-09-12 19:56:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:57,150 INFO L225 Difference]: With dead ends: 186 [2024-09-12 19:56:57,150 INFO L226 Difference]: Without dead ends: 183 [2024-09-12 19:56:57,150 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=183, Invalid=1149, Unknown=0, NotChecked=0, Total=1332 [2024-09-12 19:56:57,152 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:57,152 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 581 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 19:56:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-09-12 19:56:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 142. [2024-09-12 19:56:57,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 101 states have internal predecessors, (108), 35 states have call successors, (35), 14 states have call predecessors, (35), 12 states have return successors, (32), 26 states have call predecessors, (32), 32 states have call successors, (32) [2024-09-12 19:56:57,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 175 transitions. [2024-09-12 19:56:57,175 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 175 transitions. Word has length 36 [2024-09-12 19:56:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:57,176 INFO L474 AbstractCegarLoop]: Abstraction has 142 states and 175 transitions. [2024-09-12 19:56:57,176 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 18 states have internal predecessors, (43), 6 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-12 19:56:57,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2024-09-12 19:56:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 19:56:57,177 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:57,177 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:57,189 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 (8)] Forceful destruction successful, exit code 0 [2024-09-12 19:56:57,378 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-12 19:56:57,378 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:57,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1670188378, now seen corresponding path program 1 times [2024-09-12 19:56:57,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:56:57,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977757991] [2024-09-12 19:56:57,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:57,380 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-12 19:56:57,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:56:57,383 INFO L229 MonitoredProcess]: Starting monitored process 9 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-12 19:56:57,384 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 (9)] Waiting until timeout for monitored process [2024-09-12 19:56:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:57,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 19:56:57,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 19:56:57,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:56:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 19:56:57,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:56:57,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977757991] [2024-09-12 19:56:57,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977757991] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 19:56:57,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:56:57,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-09-12 19:56:57,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525486961] [2024-09-12 19:56:57,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:57,546 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:56:57,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:56:57,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:56:57,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:56:57,546 INFO L87 Difference]: Start difference. First operand 142 states and 175 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:57,685 INFO L93 Difference]: Finished difference Result 181 states and 232 transitions. [2024-09-12 19:56:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:56:57,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-09-12 19:56:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:57,687 INFO L225 Difference]: With dead ends: 181 [2024-09-12 19:56:57,688 INFO L226 Difference]: Without dead ends: 180 [2024-09-12 19:56:57,688 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-09-12 19:56:57,688 INFO L434 NwaCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:57,688 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 224 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:56:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-09-12 19:56:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 80. [2024-09-12 19:56:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 55 states have internal predecessors, (60), 17 states have call successors, (17), 10 states have call predecessors, (17), 8 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-12 19:56:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2024-09-12 19:56:57,707 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 40 [2024-09-12 19:56:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:57,707 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2024-09-12 19:56:57,708 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:56:57,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2024-09-12 19:56:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-12 19:56:57,709 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:57,709 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:57,715 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 (9)] Ended with exit code 0 [2024-09-12 19:56:57,912 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-12 19:56:57,913 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:56:57,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:57,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1556751203, now seen corresponding path program 1 times [2024-09-12 19:56:57,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:56:57,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854672320] [2024-09-12 19:56:57,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:57,915 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-12 19:56:57,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:56:57,916 INFO L229 MonitoredProcess]: Starting monitored process 10 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-12 19:56:57,918 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 (10)] Waiting until timeout for monitored process [2024-09-12 19:56:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:57,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-12 19:56:57,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:57:03,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 19:57:03,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 19:57:04,008 INFO L349 Elim1Store]: treesize reduction 108, result has 45.7 percent of original size [2024-09-12 19:57:04,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 109 [2024-09-12 19:57:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:57:04,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:57:04,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:57:04,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854672320] [2024-09-12 19:57:04,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854672320] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:57:04,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1238371649] [2024-09-12 19:57:04,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:57:04,770 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-12 19:57:04,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-12 19:57:04,793 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-12 19:57:04,794 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-09-12 19:57:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:04,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 19:57:04,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:57:04,879 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-12 19:57:09,230 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_3 (_ BitVec 32))) (= (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_3) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-09-12 19:57:09,322 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-12 19:57:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:57:09,397 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:57:09,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1238371649] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:57:09,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:57:09,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [25] total 32 [2024-09-12 19:57:09,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060266591] [2024-09-12 19:57:09,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:57:09,398 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 19:57:09,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:57:09,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 19:57:09,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1162, Unknown=2, NotChecked=68, Total=1332 [2024-09-12 19:57:09,398 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 19:57:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:57:09,562 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2024-09-12 19:57:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 19:57:09,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2024-09-12 19:57:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:57:09,563 INFO L225 Difference]: With dead ends: 133 [2024-09-12 19:57:09,563 INFO L226 Difference]: Without dead ends: 78 [2024-09-12 19:57:09,564 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=112, Invalid=1296, Unknown=2, NotChecked=72, Total=1482 [2024-09-12 19:57:09,565 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:57:09,565 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 188 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 67 Unchecked, 0.1s Time] [2024-09-12 19:57:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-12 19:57:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-09-12 19:57:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.0625) internal successors, (51), 49 states have internal predecessors, (51), 17 states have call successors, (17), 10 states have call predecessors, (17), 8 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-12 19:57:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-09-12 19:57:09,590 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 45 [2024-09-12 19:57:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:57:09,590 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-09-12 19:57:09,590 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 19:57:09,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:57:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-09-12 19:57:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-12 19:57:09,591 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:57:09,591 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:57:09,597 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-09-12 19:57:09,795 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 (10)] Forceful destruction successful, exit code 0 [2024-09-12 19:57:09,992 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt,10 /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-12 19:57:09,992 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 19:57:09,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:57:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash 191191069, now seen corresponding path program 1 times [2024-09-12 19:57:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:57:09,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929523159] [2024-09-12 19:57:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:57:09,993 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-12 19:57:09,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:57:09,995 INFO L229 MonitoredProcess]: Starting monitored process 12 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-12 19:57:09,996 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 (12)] Waiting until timeout for monitored process [2024-09-12 19:57:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:10,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-12 19:57:10,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:57:19,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 19:57:19,958 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 19:57:19,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 19:57:19,961 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 19:57:20,121 INFO L349 Elim1Store]: treesize reduction 92, result has 49.5 percent of original size [2024-09-12 19:57:20,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 56 treesize of output 105 [2024-09-12 19:57:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:57:20,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:57:20,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:57:20,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929523159] [2024-09-12 19:57:20,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929523159] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:57:20,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2119053245] [2024-09-12 19:57:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:57:20,626 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-12 19:57:20,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-12 19:57:20,627 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-12 19:57:20,629 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-09-12 19:57:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:20,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 19:57:20,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:57:20,708 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-12 19:57:43,709 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_6 (_ BitVec 32))) (= (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_6) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-09-12 19:57:51,699 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_7 (_ BitVec 32))) (= (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_7) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-09-12 19:57:58,170 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_8 (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_8))) is different from true [2024-09-12 19:58:02,975 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-12 19:58:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-09-12 19:58:03,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:58:31,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2119053245] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:58:31,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:58:31,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13] total 34 [2024-09-12 19:58:31,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918851933] [2024-09-12 19:58:31,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:58:31,739 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-12 19:58:31,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:58:31,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-12 19:58:31,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1145, Unknown=13, NotChecked=210, Total=1482 [2024-09-12 19:58:31,740 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 34 states, 29 states have (on average 1.896551724137931) internal successors, (55), 25 states have internal predecessors, (55), 10 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-12 19:58:35,864 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-12 19:58:39,904 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-12 20:00:34,402 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-12 20:00:38,433 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-12 20:00:43,162 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-12 20:00:47,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 20:00:51,199 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-12 20:00:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:00:51,504 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-09-12 20:00:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-12 20:00:51,505 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 1.896551724137931) internal successors, (55), 25 states have internal predecessors, (55), 10 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 45 [2024-09-12 20:00:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:00:51,506 INFO L225 Difference]: With dead ends: 85 [2024-09-12 20:00:51,506 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 20:00:51,507 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 188.1s TimeCoverageRelationStatistics Valid=351, Invalid=2721, Unknown=20, NotChecked=330, Total=3422 [2024-09-12 20:00:51,508 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 54 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 39 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 32.1s IncrementalHoareTripleChecker+Time [2024-09-12 20:00:51,508 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 322 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 584 Invalid, 7 Unknown, 188 Unchecked, 32.1s Time] [2024-09-12 20:00:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 20:00:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 20:00:51,508 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-12 20:00:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 20:00:51,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2024-09-12 20:00:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:00:51,509 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 20:00:51,509 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 1.896551724137931) internal successors, (55), 25 states have internal predecessors, (55), 10 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-12 20:00:51,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:00:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 20:00:51,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 20:00:51,517 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2024-09-12 20:00:51,517 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2024-09-12 20:00:51,518 INFO L785 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 7 remaining) [2024-09-12 20:00:51,518 INFO L785 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2024-09-12 20:00:51,518 INFO L785 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2024-09-12 20:00:51,518 INFO L785 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2024-09-12 20:00:51,518 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-09-12 20:00:51,522 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 (12)] Ended with exit code 0 [2024-09-12 20:00:51,721 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-09-12 20:00:51,920 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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,13 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-12 20:00:51,923 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:00:51,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.