./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound1.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/nla-digbench-scaling/dijkstra-u_unwindbound1.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 d205b4d392fcf6603d2c7a58c20f30b20ad63dac227f46def37edd46d8cc7990 --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 18:40:46,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 18:40:46,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 18:40:46,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 18:40:46,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 18:40:46,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 18:40:46,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 18:40:46,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 18:40:46,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 18:40:46,936 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 18:40:46,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 18:40:46,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 18:40:46,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 18:40:46,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 18:40:46,939 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 18:40:46,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 18:40:46,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 18:40:46,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 18:40:46,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 18:40:46,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 18:40:46,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 18:40:46,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 18:40:46,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 18:40:46,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 18:40:46,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 18:40:46,947 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 18:40:46,947 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 18:40:46,948 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 18:40:46,948 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 18:40:46,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 18:40:46,948 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 18:40:46,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 18:40:46,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:40:46,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 18:40:46,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 18:40:46,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 18:40:46,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 18:40:46,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 18:40:46,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 18:40:46,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 18:40:46,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 18:40:46,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 18:40:46,951 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 -> d205b4d392fcf6603d2c7a58c20f30b20ad63dac227f46def37edd46d8cc7990 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 18:40:47,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 18:40:47,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 18:40:47,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 18:40:47,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 18:40:47,229 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 18:40:47,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound1.c [2024-09-12 18:40:48,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 18:40:48,723 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 18:40:48,724 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound1.c [2024-09-12 18:40:48,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a8c2586c7/be9d79c8b6f44ffd9a4d31811c92bbdb/FLAG9466da148 [2024-09-12 18:40:48,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a8c2586c7/be9d79c8b6f44ffd9a4d31811c92bbdb [2024-09-12 18:40:48,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 18:40:48,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 18:40:48,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 18:40:48,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 18:40:48,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 18:40:48,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:40:48" (1/1) ... [2024-09-12 18:40:48,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3074c055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:48, skipping insertion in model container [2024-09-12 18:40:48,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:40:48" (1/1) ... [2024-09-12 18:40:48,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 18:40:48,932 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound1.c[525,538] [2024-09-12 18:40:48,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:40:48,969 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 18:40:48,980 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound1.c[525,538] [2024-09-12 18:40:48,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:40:49,012 INFO L204 MainTranslator]: Completed translation [2024-09-12 18:40:49,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49 WrapperNode [2024-09-12 18:40:49,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 18:40:49,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 18:40:49,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 18:40:49,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 18:40:49,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (1/1) ... [2024-09-12 18:40:49,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (1/1) ... [2024-09-12 18:40:49,030 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 18:40:49,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 18:40:49,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 18:40:49,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 18:40:49,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 18:40:49,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (1/1) ... [2024-09-12 18:40:49,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (1/1) ... [2024-09-12 18:40:49,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (1/1) ... [2024-09-12 18:40:49,055 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 18:40:49,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (1/1) ... [2024-09-12 18:40:49,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (1/1) ... [2024-09-12 18:40:49,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (1/1) ... [2024-09-12 18:40:49,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (1/1) ... [2024-09-12 18:40:49,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (1/1) ... [2024-09-12 18:40:49,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (1/1) ... [2024-09-12 18:40:49,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 18:40:49,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 18:40:49,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 18:40:49,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 18:40:49,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (1/1) ... [2024-09-12 18:40:49,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:40:49,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:40:49,090 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 18:40:49,093 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 18:40:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 18:40:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 18:40:49,124 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 18:40:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 18:40:49,124 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 18:40:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 18:40:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 18:40:49,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 18:40:49,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 18:40:49,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 18:40:49,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 18:40:49,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 18:40:49,170 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 18:40:49,172 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 18:40:49,358 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-12 18:40:49,358 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 18:40:49,392 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 18:40:49,394 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 18:40:49,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:40:49 BoogieIcfgContainer [2024-09-12 18:40:49,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 18:40:49,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 18:40:49,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 18:40:49,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 18:40:49,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 06:40:48" (1/3) ... [2024-09-12 18:40:49,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bf6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:40:49, skipping insertion in model container [2024-09-12 18:40:49,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:40:49" (2/3) ... [2024-09-12 18:40:49,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bf6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:40:49, skipping insertion in model container [2024-09-12 18:40:49,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:40:49" (3/3) ... [2024-09-12 18:40:49,404 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound1.c [2024-09-12 18:40:49,415 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 18:40:49,416 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-09-12 18:40:49,466 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 18:40:49,472 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;@349cca63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 18:40:49,472 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-12 18:40:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 23 states have (on average 1.608695652173913) internal successors, (37), 28 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 18:40:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 18:40:49,481 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:40:49,481 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:40:49,482 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:40:49,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:49,488 INFO L85 PathProgramCache]: Analyzing trace with hash -300997547, now seen corresponding path program 1 times [2024-09-12 18:40:49,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:40:49,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535676205] [2024-09-12 18:40:49,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:49,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:40:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:49,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:40:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:49,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:40:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:49,627 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 18:40:49,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:40:49,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535676205] [2024-09-12 18:40:49,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535676205] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:40:49,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:40:49,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:40:49,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260492533] [2024-09-12 18:40:49,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:40:49,637 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:40:49,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:40:49,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:40:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:40:49,660 INFO L87 Difference]: Start difference. First operand has 45 states, 23 states have (on average 1.608695652173913) internal successors, (37), 28 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:40:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:40:49,786 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2024-09-12 18:40:49,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:40:49,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2024-09-12 18:40:49,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:40:49,794 INFO L225 Difference]: With dead ends: 87 [2024-09-12 18:40:49,794 INFO L226 Difference]: Without dead ends: 46 [2024-09-12 18:40:49,797 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 18:40:49,799 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:40:49,800 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:40:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-12 18:40:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2024-09-12 18:40:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 26 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 18:40:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2024-09-12 18:40:49,827 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 13 [2024-09-12 18:40:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:40:49,827 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-09-12 18:40:49,827 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:40:49,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2024-09-12 18:40:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 18:40:49,828 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:40:49,828 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:40:49,828 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 18:40:49,829 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:40:49,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash -243739245, now seen corresponding path program 1 times [2024-09-12 18:40:49,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:40:49,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62100833] [2024-09-12 18:40:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:49,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:40:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:49,906 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:40:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:49,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:40:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:49,924 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 18:40:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:40:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62100833] [2024-09-12 18:40:49,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62100833] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:40:49,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:40:49,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:40:49,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389415670] [2024-09-12 18:40:49,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:40:49,927 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:40:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:40:49,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:40:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:40:49,928 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:40:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:40:50,101 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2024-09-12 18:40:50,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:40:50,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-09-12 18:40:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:40:50,102 INFO L225 Difference]: With dead ends: 70 [2024-09-12 18:40:50,102 INFO L226 Difference]: Without dead ends: 45 [2024-09-12 18:40:50,103 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:40:50,104 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:40:50,104 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 107 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:40:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-12 18:40:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-12 18:40:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 30 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 18:40:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2024-09-12 18:40:50,118 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 13 [2024-09-12 18:40:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:40:50,118 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-09-12 18:40:50,118 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:40:50,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2024-09-12 18:40:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 18:40:50,119 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:40:50,119 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:40:50,119 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 18:40:50,119 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:40:50,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:50,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1347328248, now seen corresponding path program 1 times [2024-09-12 18:40:50,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:40:50,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539773977] [2024-09-12 18:40:50,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:50,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:40:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:50,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:40:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:50,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:40:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:50,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 18:40:50,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:40:50,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539773977] [2024-09-12 18:40:50,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539773977] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:40:50,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:40:50,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 18:40:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979662157] [2024-09-12 18:40:50,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:40:50,294 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 18:40:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:40:50,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 18:40:50,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:40:50,295 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:40:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:40:50,725 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2024-09-12 18:40:50,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 18:40:50,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-12 18:40:50,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:40:50,726 INFO L225 Difference]: With dead ends: 88 [2024-09-12 18:40:50,727 INFO L226 Difference]: Without dead ends: 65 [2024-09-12 18:40:50,727 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-09-12 18:40:50,728 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 41 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 18:40:50,728 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 146 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 18:40:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-12 18:40:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2024-09-12 18:40:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.393939393939394) internal successors, (46), 39 states have internal predecessors, (46), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 18:40:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2024-09-12 18:40:50,737 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 18 [2024-09-12 18:40:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:40:50,737 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2024-09-12 18:40:50,738 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:40:50,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2024-09-12 18:40:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 18:40:50,738 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:40:50,739 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:40:50,739 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 18:40:50,739 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:40:50,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:50,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1347326998, now seen corresponding path program 1 times [2024-09-12 18:40:50,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:40:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365335714] [2024-09-12 18:40:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:50,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:40:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:50,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:40:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:50,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:40:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:40:50,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:40:50,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365335714] [2024-09-12 18:40:50,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365335714] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:40:50,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484618847] [2024-09-12 18:40:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:50,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:40:50,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:40:50,851 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 18:40:50,852 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 18:40:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:50,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 18:40:50,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:40:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:40:50,968 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:40:50,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484618847] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:40:50,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:40:50,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-09-12 18:40:50,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145596738] [2024-09-12 18:40:50,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:40:50,969 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:40:50,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:40:50,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:40:50,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-09-12 18:40:50,970 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:40:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:40:51,026 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2024-09-12 18:40:51,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:40:51,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-12 18:40:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:40:51,028 INFO L225 Difference]: With dead ends: 90 [2024-09-12 18:40:51,028 INFO L226 Difference]: Without dead ends: 60 [2024-09-12 18:40:51,028 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-09-12 18:40:51,029 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:40:51,029 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:40:51,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-12 18:40:51,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2024-09-12 18:40:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 18:40:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2024-09-12 18:40:51,039 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 18 [2024-09-12 18:40:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:40:51,039 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-09-12 18:40:51,039 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:40:51,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2024-09-12 18:40:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 18:40:51,040 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:40:51,040 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:40:51,059 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 18:40:51,244 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:40:51,245 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:40:51,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:51,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1182497347, now seen corresponding path program 1 times [2024-09-12 18:40:51,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:40:51,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289591560] [2024-09-12 18:40:51,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:51,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:40:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:51,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:40:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:51,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:40:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:51,323 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 18:40:51,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:40:51,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289591560] [2024-09-12 18:40:51,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289591560] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:40:51,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:40:51,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 18:40:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996821551] [2024-09-12 18:40:51,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:40:51,326 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 18:40:51,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:40:51,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 18:40:51,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:40:51,327 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:40:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:40:51,484 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-09-12 18:40:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 18:40:51,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-09-12 18:40:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:40:51,485 INFO L225 Difference]: With dead ends: 56 [2024-09-12 18:40:51,485 INFO L226 Difference]: Without dead ends: 55 [2024-09-12 18:40:51,486 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-09-12 18:40:51,486 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 25 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:40:51,487 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 155 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:40:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-12 18:40:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-12 18:40:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 37 states have internal predecessors, (41), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 18:40:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2024-09-12 18:40:51,495 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 19 [2024-09-12 18:40:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:40:51,495 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-09-12 18:40:51,495 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 18:40:51,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2024-09-12 18:40:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 18:40:51,496 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:40:51,496 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:40:51,496 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 18:40:51,497 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:40:51,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:51,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1182536076, now seen corresponding path program 1 times [2024-09-12 18:40:51,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:40:51,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312615371] [2024-09-12 18:40:51,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:51,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:40:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:51,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:40:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:51,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:40:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:40:51,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:40:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312615371] [2024-09-12 18:40:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312615371] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:40:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199978934] [2024-09-12 18:40:51,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:51,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:40:51,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:40:51,576 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 18:40:51,577 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 18:40:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:51,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 18:40:51,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:40:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:40:51,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:40:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:40:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199978934] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:40:51,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:40:51,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2024-09-12 18:40:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676148381] [2024-09-12 18:40:51,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:40:51,700 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 18:40:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:40:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 18:40:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-09-12 18:40:51,701 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-12 18:40:51,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:40:51,898 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-09-12 18:40:51,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 18:40:51,898 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 19 [2024-09-12 18:40:51,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:40:51,899 INFO L225 Difference]: With dead ends: 60 [2024-09-12 18:40:51,899 INFO L226 Difference]: Without dead ends: 59 [2024-09-12 18:40:51,900 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-09-12 18:40:51,900 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 43 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:40:51,900 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 154 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:40:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-12 18:40:51,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2024-09-12 18:40:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.25) internal successors, (40), 36 states have internal predecessors, (40), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 18:40:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2024-09-12 18:40:51,907 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 19 [2024-09-12 18:40:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:40:51,907 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2024-09-12 18:40:51,907 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-12 18:40:51,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2024-09-12 18:40:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 18:40:51,908 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:40:51,908 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:40:51,920 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 18:40:52,112 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 18:40:52,113 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:40:52,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:52,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1610535375, now seen corresponding path program 1 times [2024-09-12 18:40:52,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:40:52,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452293488] [2024-09-12 18:40:52,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:52,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:40:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:52,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:40:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:52,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:40:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 18:40:52,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:40:52,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452293488] [2024-09-12 18:40:52,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452293488] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:40:52,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:40:52,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:40:52,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224258102] [2024-09-12 18:40:52,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:40:52,173 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:40:52,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:40:52,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:40:52,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:40:52,173 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:40:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:40:52,362 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2024-09-12 18:40:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:40:52,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-09-12 18:40:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:40:52,364 INFO L225 Difference]: With dead ends: 70 [2024-09-12 18:40:52,364 INFO L226 Difference]: Without dead ends: 47 [2024-09-12 18:40:52,364 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:40:52,365 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:40:52,365 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 69 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:40:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-12 18:40:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2024-09-12 18:40:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 18:40:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-09-12 18:40:52,370 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 22 [2024-09-12 18:40:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:40:52,371 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-09-12 18:40:52,371 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:40:52,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-09-12 18:40:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 18:40:52,372 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:40:52,372 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 18:40:52,372 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 18:40:52,372 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:40:52,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:52,372 INFO L85 PathProgramCache]: Analyzing trace with hash 880777873, now seen corresponding path program 1 times [2024-09-12 18:40:52,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:40:52,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277493169] [2024-09-12 18:40:52,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:52,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:40:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 18:40:52,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1752955396] [2024-09-12 18:40:52,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:52,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:40:52,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:40:52,387 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 18:40:52,392 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 18:40:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:52,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 18:40:52,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:40:52,473 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 18:40:52,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:40:52,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:40:52,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277493169] [2024-09-12 18:40:52,474 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 18:40:52,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752955396] [2024-09-12 18:40:52,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752955396] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:40:52,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:40:52,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:40:52,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552542737] [2024-09-12 18:40:52,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:40:52,474 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:40:52,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:40:52,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:40:52,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:40:52,475 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:40:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:40:52,495 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-09-12 18:40:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:40:52,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-09-12 18:40:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:40:52,496 INFO L225 Difference]: With dead ends: 43 [2024-09-12 18:40:52,496 INFO L226 Difference]: Without dead ends: 38 [2024-09-12 18:40:52,496 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:40:52,497 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:40:52,497 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 98 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:40:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-12 18:40:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-12 18:40:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 18:40:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-09-12 18:40:52,503 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 24 [2024-09-12 18:40:52,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:40:52,503 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2024-09-12 18:40:52,503 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:40:52,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-09-12 18:40:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 18:40:52,504 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:40:52,504 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:40:52,522 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 18:40:52,705 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-12 18:40:52,705 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:40:52,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1613010852, now seen corresponding path program 1 times [2024-09-12 18:40:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:40:52,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476924393] [2024-09-12 18:40:52,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:52,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:40:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:52,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:40:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:52,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:40:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:40:52,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:40:52,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476924393] [2024-09-12 18:40:52,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476924393] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:40:52,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644908536] [2024-09-12 18:40:52,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:52,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:40:52,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:40:52,781 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 18:40:52,783 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 18:40:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:52,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 18:40:52,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:40:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:40:52,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:40:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:40:52,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644908536] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:40:52,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:40:52,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-09-12 18:40:52,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679166987] [2024-09-12 18:40:52,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:40:52,930 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 18:40:52,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:40:52,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 18:40:52,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-09-12 18:40:52,931 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-12 18:40:53,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:40:53,046 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2024-09-12 18:40:53,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 18:40:53,046 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 23 [2024-09-12 18:40:53,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:40:53,047 INFO L225 Difference]: With dead ends: 38 [2024-09-12 18:40:53,047 INFO L226 Difference]: Without dead ends: 37 [2024-09-12 18:40:53,047 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2024-09-12 18:40:53,048 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 65 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:40:53,048 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 49 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:40:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-12 18:40:53,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-09-12 18:40:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 18:40:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2024-09-12 18:40:53,053 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 23 [2024-09-12 18:40:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:40:53,053 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2024-09-12 18:40:53,053 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-12 18:40:53,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2024-09-12 18:40:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 18:40:53,054 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:40:53,054 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 18:40:53,069 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 18:40:53,254 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:40:53,255 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 18:40:53,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:53,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1683078724, now seen corresponding path program 1 times [2024-09-12 18:40:53,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:40:53,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660006513] [2024-09-12 18:40:53,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:53,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:40:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 18:40:53,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114450718] [2024-09-12 18:40:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:40:53,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:40:53,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:40:53,274 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 18:40:53,275 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 18:40:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:40:53,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 18:40:53,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:40:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:40:53,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:40:53,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:40:53,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660006513] [2024-09-12 18:40:53,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 18:40:53,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114450718] [2024-09-12 18:40:53,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114450718] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:40:53,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:40:53,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:40:53,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857543293] [2024-09-12 18:40:53,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:40:53,389 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:40:53,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:40:53,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:40:53,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:40:53,389 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:40:54,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 18:40:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:40:54,943 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2024-09-12 18:40:54,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:40:54,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-09-12 18:40:54,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:40:54,944 INFO L225 Difference]: With dead ends: 34 [2024-09-12 18:40:54,944 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 18:40:54,944 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:40:54,945 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-09-12 18:40:54,945 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-09-12 18:40:54,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 18:40:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 18:40:54,946 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 18:40:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 18:40:54,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-09-12 18:40:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:40:54,946 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 18:40:54,946 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:40:54,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:40:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 18:40:54,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 18:40:54,949 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 5 remaining) [2024-09-12 18:40:54,949 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2024-09-12 18:40:54,949 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2024-09-12 18:40:54,949 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2024-09-12 18:40:54,949 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-09-12 18:40:54,965 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 18:40:55,150 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 18:40:55,153 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:40:55,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 18:40:56,188 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 18:40:56,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 06:40:56 BoogieIcfgContainer [2024-09-12 18:40:56,200 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 18:40:56,200 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 18:40:56,200 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 18:40:56,200 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 18:40:56,201 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:40:49" (3/4) ... [2024-09-12 18:40:56,202 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 18:40:56,204 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 18:40:56,205 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-12 18:40:56,205 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 18:40:56,205 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 18:40:56,209 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-12 18:40:56,209 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-12 18:40:56,210 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 18:40:56,210 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 18:40:56,228 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((p == 0) && (n == r)) && (counter == 1)) && (h == 0)) || ((((p == 0) && (n == r)) && (counter == 0)) && (h == 0))) && (\old(counter) == 0)) [2024-09-12 18:40:56,229 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((p == 0) && (n == r)) && (\old(counter) == 0)) && (((counter == 1) && (h == 0)) || ((h == 0) && (counter == 2)))) [2024-09-12 18:40:56,280 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 18:40:56,281 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 18:40:56,281 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 18:40:56,281 INFO L158 Benchmark]: Toolchain (without parser) took 7503.29ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 75.1MB in the beginning and 79.8MB in the end (delta: -4.7MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2024-09-12 18:40:56,281 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 58.7MB. Free memory was 39.1MB in the beginning and 39.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:40:56,282 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.18ms. Allocated memory is still 94.4MB. Free memory was 74.8MB in the beginning and 62.4MB in the end (delta: 12.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 18:40:56,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.42ms. Allocated memory is still 94.4MB. Free memory was 62.1MB in the beginning and 61.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:40:56,282 INFO L158 Benchmark]: Boogie Preprocessor took 31.47ms. Allocated memory is still 94.4MB. Free memory was 61.0MB in the beginning and 59.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:40:56,282 INFO L158 Benchmark]: RCFGBuilder took 331.51ms. Allocated memory is still 94.4MB. Free memory was 59.3MB in the beginning and 73.9MB in the end (delta: -14.7MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2024-09-12 18:40:56,282 INFO L158 Benchmark]: TraceAbstraction took 6804.06ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 73.4MB in the beginning and 85.0MB in the end (delta: -11.6MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2024-09-12 18:40:56,283 INFO L158 Benchmark]: Witness Printer took 80.52ms. Allocated memory is still 144.7MB. Free memory was 85.0MB in the beginning and 79.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 18:40:56,284 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.57ms. Allocated memory is still 58.7MB. Free memory was 39.1MB in the beginning and 39.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.18ms. Allocated memory is still 94.4MB. Free memory was 74.8MB in the beginning and 62.4MB in the end (delta: 12.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.42ms. Allocated memory is still 94.4MB. Free memory was 62.1MB in the beginning and 61.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.47ms. Allocated memory is still 94.4MB. Free memory was 61.0MB in the beginning and 59.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.51ms. Allocated memory is still 94.4MB. Free memory was 59.3MB in the beginning and 73.9MB in the end (delta: -14.7MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6804.06ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 73.4MB in the beginning and 85.0MB in the end (delta: -11.6MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. * Witness Printer took 80.52ms. Allocated memory is still 144.7MB. Free memory was 85.0MB in the beginning and 79.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: 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 5 procedures, 45 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 1082 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 763 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 865 IncrementalHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 319 mSDtfsCounter, 865 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 36 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 SizeOfPredicates, 16 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 8/31 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 5 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((p == 0) && (n == r)) && (\old(counter) == 0)) && (((counter == 1) && (h == 0)) || ((h == 0) && (counter == 2)))) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((p == 0) && (n == r)) && (counter == 1)) && (h == 0)) || ((((p == 0) && (n == r)) && (counter == 0)) && (h == 0))) && (\old(counter) == 0)) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (counter == 0) - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: ((1 <= counter) && (1 <= \old(cond))) Ensures: ((1 <= counter) && (1 <= \old(cond))) RESULT: Ultimate proved your program to be correct! [2024-09-12 18:40:56,300 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE