./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound2.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/geo3-ll_unwindbound2.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 b726a01b63df029fc0c850314d58756215e9005a3c5843275f7c9e8b82182102 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 19:09:54,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:09:54,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:09:54,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:09:54,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:09:54,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:09:54,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:09:54,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:09:54,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:09:54,462 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:09:54,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:09:54,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:09:54,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:09:54,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:09:54,463 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:09:54,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:09:54,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:09:54,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:09:54,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:09:54,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:09:54,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:09:54,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:09:54,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:09:54,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:09:54,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:09:54,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:09:54,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:09:54,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:09:54,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:09:54,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:09:54,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:09:54,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:09:54,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:09:54,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:09:54,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:09:54,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:09:54,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:09:54,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:09:54,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:09:54,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:09:54,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:09:54,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:09:54,469 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 -> b726a01b63df029fc0c850314d58756215e9005a3c5843275f7c9e8b82182102 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 19:09:54,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:09:54,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:09:54,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:09:54,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:09:54,730 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:09:54,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound2.c [2024-09-12 19:09:56,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:09:56,308 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:09:56,309 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound2.c [2024-09-12 19:09:56,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/9c950c21f/dd1e31ec262148c88852abbcf9d44cf7/FLAGe5ade2fa6 [2024-09-12 19:09:56,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/9c950c21f/dd1e31ec262148c88852abbcf9d44cf7 [2024-09-12 19:09:56,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:09:56,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:09:56,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:09:56,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:09:56,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:09:56,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e9282b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56, skipping insertion in model container [2024-09-12 19:09:56,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:09:56,488 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/geo3-ll_unwindbound2.c[525,538] [2024-09-12 19:09:56,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:09:56,513 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:09:56,523 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/geo3-ll_unwindbound2.c[525,538] [2024-09-12 19:09:56,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:09:56,541 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:09:56,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56 WrapperNode [2024-09-12 19:09:56,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:09:56,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:09:56,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:09:56,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:09:56,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,571 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:09:56,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:09:56,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:09:56,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:09:56,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:09:56,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,597 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 19:09:56,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:09:56,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:09:56,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:09:56,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:09:56,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (1/1) ... [2024-09-12 19:09:56,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:09:56,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:09:56,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 19:09:56,655 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 19:09:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:09:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:09:56,687 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:09:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:09:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:09:56,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:09:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:09:56,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:09:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 19:09:56,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 19:09:56,739 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:09:56,740 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:09:56,878 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-09-12 19:09:56,879 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:09:56,901 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:09:56,902 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 19:09:56,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:09:56 BoogieIcfgContainer [2024-09-12 19:09:56,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:09:56,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:09:56,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:09:56,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:09:56,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:09:56" (1/3) ... [2024-09-12 19:09:56,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477b1348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:09:56, skipping insertion in model container [2024-09-12 19:09:56,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:09:56" (2/3) ... [2024-09-12 19:09:56,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477b1348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:09:56, skipping insertion in model container [2024-09-12 19:09:56,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:09:56" (3/3) ... [2024-09-12 19:09:56,909 INFO L112 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound2.c [2024-09-12 19:09:56,920 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:09:56,921 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-09-12 19:09:56,962 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:09:56,967 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;@3707bab1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:09:56,969 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-12 19:09:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 15 states have (on average 1.6) internal successors, (24), 20 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 19:09:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-12 19:09:56,977 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:09:56,977 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-12 19:09:56,979 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:09:56,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:56,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2009622645, now seen corresponding path program 1 times [2024-09-12 19:09:56,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:09:56,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731718147] [2024-09-12 19:09:56,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:56,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:09:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:09:57,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [922134045] [2024-09-12 19:09:57,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:57,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:09:57,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:09:57,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:09:57,075 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 19:09:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:57,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 19:09:57,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:09:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:09:57,163 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:09:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:09:57,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731718147] [2024-09-12 19:09:57,164 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:09:57,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922134045] [2024-09-12 19:09:57,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922134045] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:09:57,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:09:57,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:09:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322913240] [2024-09-12 19:09:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:09:57,177 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:09:57,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:09:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:09:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:09:57,208 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.6) internal successors, (24), 20 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:09:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:09:57,252 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-09-12 19:09:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:09:57,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 6 [2024-09-12 19:09:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:09:57,268 INFO L225 Difference]: With dead ends: 47 [2024-09-12 19:09:57,269 INFO L226 Difference]: Without dead ends: 22 [2024-09-12 19:09:57,272 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:09:57,275 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:09:57,276 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 35 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:09:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-12 19:09:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-12 19:09:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 19:09:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-09-12 19:09:57,316 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 6 [2024-09-12 19:09:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:09:57,317 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-09-12 19:09:57,317 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:09:57,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-09-12 19:09:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-12 19:09:57,318 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:09:57,318 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:09:57,332 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 19:09:57,518 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-09-12 19:09:57,520 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:09:57,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1119039362, now seen corresponding path program 1 times [2024-09-12 19:09:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:09:57,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380593735] [2024-09-12 19:09:57,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:57,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:09:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:57,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:09:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:09:57,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:09:57,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380593735] [2024-09-12 19:09:57,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380593735] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:09:57,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:09:57,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 19:09:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031587377] [2024-09-12 19:09:57,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:09:57,685 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:09:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:09:57,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:09:57,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:09:57,686 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:09:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:09:57,800 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-09-12 19:09:57,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:09:57,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-09-12 19:09:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:09:57,801 INFO L225 Difference]: With dead ends: 35 [2024-09-12 19:09:57,801 INFO L226 Difference]: Without dead ends: 26 [2024-09-12 19:09:57,801 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 19:09:57,802 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:09:57,803 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 39 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:09:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-12 19:09:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-12 19:09:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 19:09:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-09-12 19:09:57,815 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 9 [2024-09-12 19:09:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:09:57,815 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-09-12 19:09:57,815 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:09:57,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-09-12 19:09:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 19:09:57,816 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:09:57,816 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:09:57,816 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:09:57,816 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:09:57,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash 45828087, now seen corresponding path program 1 times [2024-09-12 19:09:57,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:09:57,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359395138] [2024-09-12 19:09:57,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:57,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:09:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:09:57,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [405963719] [2024-09-12 19:09:57,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:57,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:09:57,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:09:57,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:09:57,848 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 19:09:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:57,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 19:09:57,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:09:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:09:57,978 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:09:57,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:09:57,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359395138] [2024-09-12 19:09:57,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:09:57,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405963719] [2024-09-12 19:09:57,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405963719] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:09:57,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:09:57,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 19:09:57,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923238897] [2024-09-12 19:09:57,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:09:57,979 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:09:57,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:09:57,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:09:57,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:09:57,980 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:09:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:09:58,052 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-09-12 19:09:58,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:09:58,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 19:09:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:09:58,053 INFO L225 Difference]: With dead ends: 35 [2024-09-12 19:09:58,053 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 19:09:58,053 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-12 19:09:58,054 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:09:58,054 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:09:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 19:09:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 19:09:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 4 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 19:09:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-09-12 19:09:58,068 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2024-09-12 19:09:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:09:58,068 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-09-12 19:09:58,068 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:09:58,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-09-12 19:09:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 19:09:58,070 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:09:58,070 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:09:58,084 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 19:09:58,274 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:09:58,275 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:09:58,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:58,276 INFO L85 PathProgramCache]: Analyzing trace with hash 742340353, now seen corresponding path program 1 times [2024-09-12 19:09:58,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:09:58,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401998632] [2024-09-12 19:09:58,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:58,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:09:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:58,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:09:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:58,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:09:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:58,428 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 19:09:58,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:09:58,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401998632] [2024-09-12 19:09:58,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401998632] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:09:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274956761] [2024-09-12 19:09:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:58,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:09:58,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:09:58,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:09:58,432 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 19:09:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:58,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 19:09:58,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:09:58,501 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 19:09:58,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:09:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274956761] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:09:58,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:09:58,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-09-12 19:09:58,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110072351] [2024-09-12 19:09:58,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:09:58,502 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:09:58,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:09:58,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:09:58,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:09:58,503 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 19:09:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:09:58,528 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-09-12 19:09:58,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 19:09:58,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-09-12 19:09:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:09:58,530 INFO L225 Difference]: With dead ends: 32 [2024-09-12 19:09:58,530 INFO L226 Difference]: Without dead ends: 31 [2024-09-12 19:09:58,530 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-09-12 19:09:58,531 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:09:58,531 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:09:58,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-12 19:09:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-12 19:09:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 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 19:09:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-09-12 19:09:58,541 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 19 [2024-09-12 19:09:58,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:09:58,541 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-09-12 19:09:58,541 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 19:09:58,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-09-12 19:09:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 19:09:58,542 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:09:58,543 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:09:58,556 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 19:09:58,746 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:09:58,747 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:09:58,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:58,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1537714511, now seen corresponding path program 1 times [2024-09-12 19:09:58,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:09:58,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088303874] [2024-09-12 19:09:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:09:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:58,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:09:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:58,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:09:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:58,840 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 19:09:58,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:09:58,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088303874] [2024-09-12 19:09:58,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088303874] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:09:58,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720382987] [2024-09-12 19:09:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:58,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:09:58,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:09:58,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:09:58,843 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 19:09:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:58,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 19:09:58,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:09:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:09:58,920 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:09:58,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720382987] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:09:58,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:09:58,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-09-12 19:09:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111710245] [2024-09-12 19:09:58,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:09:58,921 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:09:58,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:09:58,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:09:58,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:09:58,922 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 19:09:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:09:58,959 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-09-12 19:09:58,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:09:58,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-09-12 19:09:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:09:58,960 INFO L225 Difference]: With dead ends: 38 [2024-09-12 19:09:58,960 INFO L226 Difference]: Without dead ends: 35 [2024-09-12 19:09:58,960 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-09-12 19:09:58,961 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:09:58,961 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:09:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-12 19:09:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-09-12 19:09:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 19:09:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-09-12 19:09:58,970 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2024-09-12 19:09:58,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:09:58,970 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-09-12 19:09:58,970 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 19:09:58,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:58,970 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-09-12 19:09:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 19:09:58,971 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:09:58,971 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:09:58,983 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 19:09:59,171 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:09:59,172 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:09:59,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:59,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1048692234, now seen corresponding path program 1 times [2024-09-12 19:09:59,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:09:59,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27176475] [2024-09-12 19:09:59,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:59,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:09:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:59,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:09:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:59,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:09:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:09:59,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:09:59,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27176475] [2024-09-12 19:09:59,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27176475] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:09:59,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717266630] [2024-09-12 19:09:59,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:59,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:09:59,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:09:59,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:09:59,307 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 19:09:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:59,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 19:09:59,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:09:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:09:59,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:09:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:09:59,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717266630] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:09:59,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:09:59,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 10 [2024-09-12 19:09:59,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385090301] [2024-09-12 19:09:59,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:09:59,462 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 19:09:59,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:09:59,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 19:09:59,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:09:59,462 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:09:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:09:59,548 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-09-12 19:09:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 19:09:59,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-09-12 19:09:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:09:59,550 INFO L225 Difference]: With dead ends: 42 [2024-09-12 19:09:59,550 INFO L226 Difference]: Without dead ends: 37 [2024-09-12 19:09:59,550 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-09-12 19:09:59,551 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:09:59,551 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 56 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:09:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-12 19:09:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-12 19:09:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 19:09:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-09-12 19:09:59,561 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 25 [2024-09-12 19:09:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:09:59,561 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-09-12 19:09:59,561 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:09:59,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-09-12 19:09:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 19:09:59,563 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:09:59,563 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:09:59,581 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 19:09:59,763 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 19:09:59,764 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:09:59,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:09:59,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1046904774, now seen corresponding path program 1 times [2024-09-12 19:09:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:09:59,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236960206] [2024-09-12 19:09:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:59,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:09:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:09:59,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304528227] [2024-09-12 19:09:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:09:59,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:09:59,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:09:59,798 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:09:59,799 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 19:09:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:09:59,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-12 19:09:59,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:10:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:10:00,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:10:17,326 WARN L876 $PredicateComparison]: unable to prove that (or (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0) (* c_main_~a~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~az~0 c_main_~z~0)) 18446744073709551616) 0) (not (= (mod (+ (* c_main_~x~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~az~0) (* 18446744073709551615 c_main_~x~0) c_main_~a~0) 18446744073709551616) 0))) is different from true [2024-09-12 19:10:33,613 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 19:11:04,818 WARN L293 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 19:11:12,834 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 19:11:16,849 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~a~0 c_main_~z~0))) (or (not (= (mod (+ (* c_main_~x~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0) (* 18446744073709551615 c_main_~y~0 c_main_~a~0 c_main_~z~0) c_main_~a~0) 18446744073709551616) 0)) (< 9223372036854775807 .cse0) (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~a~0 c_main_~z~0 c_main_~z~0) .cse0 (* 18446744073709551615 c_main_~x~0 c_main_~z~0)) 18446744073709551616) 0))) is different from true [2024-09-12 19:11:24,966 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 19:11:41,101 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 19:11:45,114 WARN L876 $PredicateComparison]: unable to prove that (forall ((main_~z~0 Int)) (let ((.cse0 (* main_~z~0 c_main_~a~0))) (or (not (= (mod (+ (* 18446744073709551615 main_~z~0 c_main_~y~0 c_main_~a~0) (* 18446744073709551615 c_main_~x~0) (* main_~z~0 c_main_~x~0) c_main_~a~0) 18446744073709551616) 0)) (< 9223372036854775807 .cse0) (< (+ .cse0 9223372036854775808) 0) (= (mod (+ (* main_~z~0 main_~z~0 c_main_~x~0) .cse0 (* 18446744073709551615 main_~z~0 c_main_~x~0) (* 18446744073709551615 main_~z~0 main_~z~0 c_main_~y~0 c_main_~a~0)) 18446744073709551616) 0)))) is different from true [2024-09-12 19:11:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-09-12 19:11:45,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:11:45,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236960206] [2024-09-12 19:11:45,128 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:11:45,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304528227] [2024-09-12 19:11:45,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304528227] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:11:45,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:11:45,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2024-09-12 19:11:45,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556639258] [2024-09-12 19:11:45,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:11:45,129 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-12 19:11:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:11:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-12 19:11:45,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=124, Unknown=4, NotChecked=72, Total=240 [2024-09-12 19:11:45,134 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 19:11:55,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:11:59,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:12:03,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:12:07,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:12:11,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:12:15,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:12:19,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:12:23,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:12:27,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:12:31,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:12:35,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:12:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:12:35,258 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-09-12 19:12:35,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 19:12:35,262 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-09-12 19:12:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:12:35,264 INFO L225 Difference]: With dead ends: 62 [2024-09-12 19:12:35,264 INFO L226 Difference]: Without dead ends: 53 [2024-09-12 19:12:35,264 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=53, Invalid=165, Unknown=4, NotChecked=84, Total=306 [2024-09-12 19:12:35,264 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 44.7s IncrementalHoareTripleChecker+Time [2024-09-12 19:12:35,265 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 160 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 11 Unknown, 170 Unchecked, 44.7s Time] [2024-09-12 19:12:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-12 19:12:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-12 19:12:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 19:12:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2024-09-12 19:12:35,289 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 25 [2024-09-12 19:12:35,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:12:35,290 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-09-12 19:12:35,290 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 19:12:35,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:12:35,290 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2024-09-12 19:12:35,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-12 19:12:35,291 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:12:35,291 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:12:35,301 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 19:12:35,498 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:12:35,498 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 19:12:35,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:12:35,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1299950529, now seen corresponding path program 2 times [2024-09-12 19:12:35,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:12:35,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256941916] [2024-09-12 19:12:35,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:12:35,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:12:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:12:35,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:12:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:12:35,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:12:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:12:35,658 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-12 19:12:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:12:35,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-12 19:12:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:12:35,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-12 19:12:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:12:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 46 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 19:12:35,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:12:35,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256941916] [2024-09-12 19:12:35,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256941916] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:12:35,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022693804] [2024-09-12 19:12:35,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:12:35,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:12:35,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:12:35,674 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:12:35,675 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 19:12:35,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:12:35,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:12:35,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 19:12:35,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:12:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-12 19:12:35,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:12:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-12 19:12:35,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022693804] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:12:35,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:12:35,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 14 [2024-09-12 19:12:35,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442339858] [2024-09-12 19:12:35,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:12:35,860 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 19:12:35,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:12:35,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 19:12:35,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-09-12 19:12:35,864 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 7 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-12 19:12:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:12:35,988 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2024-09-12 19:12:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 19:12:35,988 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 7 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2024-09-12 19:12:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:12:35,988 INFO L225 Difference]: With dead ends: 57 [2024-09-12 19:12:35,989 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 19:12:35,989 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-09-12 19:12:35,990 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:12:35,990 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 47 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:12:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 19:12:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 19:12:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 19:12:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 19:12:35,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2024-09-12 19:12:35,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:12:35,991 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 19:12:35,991 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 7 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-12 19:12:35,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:12:35,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 19:12:35,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 19:12:35,993 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 5 remaining) [2024-09-12 19:12:35,994 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2024-09-12 19:12:35,994 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2024-09-12 19:12:35,994 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2024-09-12 19:12:35,994 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-09-12 19:12:36,007 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 19:12:36,198 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:12:36,201 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-12 19:12:36,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 19:12:51,504 WARN L293 SmtUtils]: Spent 15.17s on a formula simplification. DAG size of input: 59 DAG size of output: 48 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 19:13:29,233 WARN L293 SmtUtils]: Spent 37.72s on a formula simplification. DAG size of input: 62 DAG size of output: 36 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 19:13:47,553 WARN L293 SmtUtils]: Spent 18.31s on a formula simplification. DAG size of input: 64 DAG size of output: 53 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 19:14:03,216 WARN L293 SmtUtils]: Spent 15.60s on a formula simplification. DAG size of input: 63 DAG size of output: 52 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 19:14:13,074 WARN L293 SmtUtils]: Spent 9.80s on a formula simplification. DAG size of input: 63 DAG size of output: 52 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 19:14:13,582 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 19:14:13,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 07:14:13 BoogieIcfgContainer [2024-09-12 19:14:13,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 19:14:13,613 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 19:14:13,613 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 19:14:13,613 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 19:14:13,613 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:09:56" (3/4) ... [2024-09-12 19:14:13,619 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 19:14:13,621 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 19:14:13,621 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 19:14:13,621 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 19:14:13,628 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-09-12 19:14:13,628 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-12 19:14:13,628 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 19:14:13,628 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 19:14:13,669 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(counter) == 0) && ((((((((((z == y) && (0 <= (z + 2147483648))) && (z <= 2147483647)) && (0 <= (a + 2147483648))) && (counter == 1)) && (x == (((long long) a * z) + a))) && (a <= 2147483647)) && (((long long) a * z) == az)) || (((((((0 <= (z + 2147483648)) && (z <= 2147483647)) && (((((((long long) a * z) + ((__int128) ((long long) z * z) * x)) + ((((__int128) 18446744073709551615U * z) * y) * az)) + (((__int128) 18446744073709551615U * z) * x)) % ((unsigned __int128) 1 << 64)) == 0)) && (0 <= (a + 2147483648))) && (((((((__int128) z * x) + (((unsigned __int128) 18446744073709551615U * y) * az)) + a) + ((unsigned __int128) 18446744073709551615U * x)) % ((unsigned __int128) 1 << 64)) == 0)) && (counter == 2)) && (a <= 2147483647))) || ((((((((0 <= (z + 2147483648)) && (y == 1)) && (z <= 2147483647)) && (0 <= (a + 2147483648))) && (counter == 0)) && (a == x)) && (a <= 2147483647)) && (((long long) a * z) == az)))) [2024-09-12 19:14:13,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 19:14:13,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 19:14:13,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 19:14:13,730 INFO L158 Benchmark]: Toolchain (without parser) took 257395.34ms. Allocated memory was 96.5MB in the beginning and 146.8MB in the end (delta: 50.3MB). Free memory was 58.2MB in the beginning and 81.0MB in the end (delta: -22.8MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-09-12 19:14:13,730 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory is still 29.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:14:13,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.85ms. Allocated memory is still 96.5MB. Free memory was 58.0MB in the beginning and 46.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 19:14:13,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.95ms. Allocated memory is still 96.5MB. Free memory was 46.4MB in the beginning and 77.6MB in the end (delta: -31.2MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-09-12 19:14:13,731 INFO L158 Benchmark]: Boogie Preprocessor took 38.05ms. Allocated memory is still 96.5MB. Free memory was 77.6MB in the beginning and 75.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 19:14:13,731 INFO L158 Benchmark]: RCFGBuilder took 291.38ms. Allocated memory is still 96.5MB. Free memory was 75.6MB in the beginning and 63.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 19:14:13,731 INFO L158 Benchmark]: TraceAbstraction took 256708.00ms. Allocated memory was 96.5MB in the beginning and 146.8MB in the end (delta: 50.3MB). Free memory was 62.2MB in the beginning and 86.3MB in the end (delta: -24.1MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2024-09-12 19:14:13,731 INFO L158 Benchmark]: Witness Printer took 117.24ms. Allocated memory is still 146.8MB. Free memory was 85.2MB in the beginning and 81.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 19:14:13,733 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory is still 29.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.85ms. Allocated memory is still 96.5MB. Free memory was 58.0MB in the beginning and 46.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.95ms. Allocated memory is still 96.5MB. Free memory was 46.4MB in the beginning and 77.6MB in the end (delta: -31.2MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.05ms. Allocated memory is still 96.5MB. Free memory was 77.6MB in the beginning and 75.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 291.38ms. Allocated memory is still 96.5MB. Free memory was 75.6MB in the beginning and 63.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 256708.00ms. Allocated memory was 96.5MB in the beginning and 146.8MB in the end (delta: 50.3MB). Free memory was 62.2MB in the beginning and 86.3MB in the end (delta: -24.1MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Witness Printer took 117.24ms. Allocated memory is still 146.8MB. Free memory was 85.2MB in the beginning and 81.0MB in the end (delta: 4.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: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 159.3s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 50.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 45.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 512 SdHoareTripleChecker+Invalid, 44.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 170 IncrementalHoareTripleChecker+Unchecked, 383 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 405 IncrementalHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 129 mSDtfsCounter, 405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 248 SyntacticMatches, 16 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 22.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=7, InterpolantAutomatonStates: 62, 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, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 106.3s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 383 ConstructedInterpolants, 1 QuantifiedInterpolants, 1686 SizeOfPredicates, 16 NumberOfNonLiveVariables, 602 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 247/294 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: 35]: Loop Invariant Derived loop invariant: ((\old(counter) == 0) && ((((((((((z == y) && (0 <= (z + 2147483648))) && (z <= 2147483647)) && (0 <= (a + 2147483648))) && (counter == 1)) && (x == (((long long) a * z) + a))) && (a <= 2147483647)) && (((long long) a * z) == az)) || (((((((0 <= (z + 2147483648)) && (z <= 2147483647)) && (((((((long long) a * z) + ((__int128) ((long long) z * z) * x)) + ((((__int128) 18446744073709551615U * z) * y) * az)) + (((__int128) 18446744073709551615U * z) * x)) % ((unsigned __int128) 1 << 64)) == 0)) && (0 <= (a + 2147483648))) && (((((((__int128) z * x) + (((unsigned __int128) 18446744073709551615U * y) * az)) + a) + ((unsigned __int128) 18446744073709551615U * x)) % ((unsigned __int128) 1 << 64)) == 0)) && (counter == 2)) && (a <= 2147483647))) || ((((((((0 <= (z + 2147483648)) && (y == 1)) && (z <= 2147483647)) && (0 <= (a + 2147483648))) && (counter == 0)) && (a == x)) && (a <= 2147483647)) && (((long long) a * z) == az)))) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-12 19:14:13,793 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE