./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound10.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/geo1-ll_unwindbound10.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 bdb594c873073d652fb54f506ec7ea8f7caa1cb8c040606ba09f2d3f5e908396 --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:03:11,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:03:11,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:03:11,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:03:11,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:03:11,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:03:11,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:03:11,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:03:11,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:03:11,650 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:03:11,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:03:11,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:03:11,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:03:11,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:03:11,652 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:03:11,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:03:11,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:03:11,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:03:11,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:03:11,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:03:11,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:03:11,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:03:11,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:03:11,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:03:11,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:03:11,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:03:11,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:03:11,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:03:11,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:03:11,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:03:11,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:03:11,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:03:11,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:03:11,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:03:11,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:03:11,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:03:11,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:03:11,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:03:11,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:03:11,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:03:11,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:03:11,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:03:11,661 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 -> bdb594c873073d652fb54f506ec7ea8f7caa1cb8c040606ba09f2d3f5e908396 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:03:11,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:03:11,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:03:11,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:03:11,897 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:03:11,897 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:03:11,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound10.c [2024-09-12 19:03:13,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:03:13,319 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:03:13,319 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound10.c [2024-09-12 19:03:13,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8031bcc93/c4ac0c7bf9934c67bae6ea34e8b71c90/FLAGe438149bb [2024-09-12 19:03:13,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8031bcc93/c4ac0c7bf9934c67bae6ea34e8b71c90 [2024-09-12 19:03:13,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:03:13,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:03:13,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:03:13,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:03:13,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:03:13,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:03:13" (1/1) ... [2024-09-12 19:03:13,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62942bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13, skipping insertion in model container [2024-09-12 19:03:13,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:03:13" (1/1) ... [2024-09-12 19:03:13,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:03:13,912 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/geo1-ll_unwindbound10.c[546,559] [2024-09-12 19:03:13,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:03:13,935 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:03:13,944 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/geo1-ll_unwindbound10.c[546,559] [2024-09-12 19:03:13,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:03:13,966 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:03:13,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13 WrapperNode [2024-09-12 19:03:13,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:03:13,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:03:13,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:03:13,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:03:13,974 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:03:13" (1/1) ... [2024-09-12 19:03:13,978 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:03:13" (1/1) ... [2024-09-12 19:03:13,983 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:03:13,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:03:13,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:03:13,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:03:13,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:03:13,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13" (1/1) ... [2024-09-12 19:03:13,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13" (1/1) ... [2024-09-12 19:03:13,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13" (1/1) ... [2024-09-12 19:03:14,003 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:03:14,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13" (1/1) ... [2024-09-12 19:03:14,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13" (1/1) ... [2024-09-12 19:03:14,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13" (1/1) ... [2024-09-12 19:03:14,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13" (1/1) ... [2024-09-12 19:03:14,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13" (1/1) ... [2024-09-12 19:03:14,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13" (1/1) ... [2024-09-12 19:03:14,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:03:14,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:03:14,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:03:14,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:03:14,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13" (1/1) ... [2024-09-12 19:03:14,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:03:14,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:03:14,041 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:03:14,046 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:03:14,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:03:14,076 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 19:03:14,076 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 19:03:14,077 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:03:14,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:03:14,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:03:14,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:03:14,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:03:14,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:03:14,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:03:14,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 19:03:14,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 19:03:14,127 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:03:14,128 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:03:14,243 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-12 19:03:14,244 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:03:14,259 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:03:14,259 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 19:03:14,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:03:14 BoogieIcfgContainer [2024-09-12 19:03:14,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:03:14,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:03:14,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:03:14,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:03:14,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:03:13" (1/3) ... [2024-09-12 19:03:14,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2350e1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:03:14, skipping insertion in model container [2024-09-12 19:03:14,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:03:13" (2/3) ... [2024-09-12 19:03:14,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2350e1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:03:14, skipping insertion in model container [2024-09-12 19:03:14,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:03:14" (3/3) ... [2024-09-12 19:03:14,268 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound10.c [2024-09-12 19:03:14,279 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:03:14,279 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-09-12 19:03:14,315 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:03:14,320 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;@528d739e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:03:14,320 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-12 19:03:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 19:03:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 19:03:14,329 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:03:14,329 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:03:14,330 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:03:14,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2052236398, now seen corresponding path program 1 times [2024-09-12 19:03:14,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:03:14,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375255333] [2024-09-12 19:03:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:14,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:03:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:14,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:03:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:14,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:03:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:14,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:03:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:03:14,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:03:14,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375255333] [2024-09-12 19:03:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375255333] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:03:14,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:03:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 19:03:14,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83723983] [2024-09-12 19:03:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:03:14,467 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:03:14,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:03:14,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:03:14,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:03:14,482 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:03:14,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:03:14,543 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2024-09-12 19:03:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:03:14,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2024-09-12 19:03:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:03:14,551 INFO L225 Difference]: With dead ends: 69 [2024-09-12 19:03:14,551 INFO L226 Difference]: Without dead ends: 36 [2024-09-12 19:03:14,553 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:03:14,556 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:03:14,556 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 39 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:03:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-12 19:03:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-09-12 19:03:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 19:03:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-09-12 19:03:14,587 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2024-09-12 19:03:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:03:14,587 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-09-12 19:03:14,587 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:03:14,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-09-12 19:03:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 19:03:14,589 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:03:14,589 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:03:14,589 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 19:03:14,589 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:03:14,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:14,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1484408018, now seen corresponding path program 1 times [2024-09-12 19:03:14,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:03:14,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100150281] [2024-09-12 19:03:14,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:14,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:03:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:14,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:03:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:14,755 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:03:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:14,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:03:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:03:14,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:03:14,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100150281] [2024-09-12 19:03:14,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100150281] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:03:14,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:03:14,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:03:14,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692674173] [2024-09-12 19:03:14,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:03:14,781 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:03:14,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:03:14,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:03:14,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:03:14,781 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:03:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:03:14,887 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-09-12 19:03:14,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:03:14,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2024-09-12 19:03:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:03:14,889 INFO L225 Difference]: With dead ends: 48 [2024-09-12 19:03:14,889 INFO L226 Difference]: Without dead ends: 35 [2024-09-12 19:03:14,890 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:03:14,891 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:03:14,891 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 57 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:03:14,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-12 19:03:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-12 19:03:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 19:03:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-09-12 19:03:14,903 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 18 [2024-09-12 19:03:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:03:14,904 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-09-12 19:03:14,905 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:03:14,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-09-12 19:03:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 19:03:14,907 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:03:14,907 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:03:14,908 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:03:14,908 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:03:14,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:14,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1069611971, now seen corresponding path program 1 times [2024-09-12 19:03:14,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:03:14,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622517297] [2024-09-12 19:03:14,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:14,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:03:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:03:14,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1520618682] [2024-09-12 19:03:14,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:14,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:03:14,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:03:14,936 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:03:14,937 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:03:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:14,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 19:03:14,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:03:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:03:15,069 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:03:15,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:03:15,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622517297] [2024-09-12 19:03:15,070 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:03:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520618682] [2024-09-12 19:03:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520618682] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:03:15,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:03:15,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:03:15,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777390754] [2024-09-12 19:03:15,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:03:15,073 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:03:15,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:03:15,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:03:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:03:15,075 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 19:03:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:03:15,126 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-09-12 19:03:15,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:03:15,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-12 19:03:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:03:15,127 INFO L225 Difference]: With dead ends: 45 [2024-09-12 19:03:15,128 INFO L226 Difference]: Without dead ends: 43 [2024-09-12 19:03:15,128 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:03:15,129 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:03:15,130 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 97 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:03:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-12 19:03:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-09-12 19:03:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 19:03:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-09-12 19:03:15,140 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2024-09-12 19:03:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:03:15,141 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-09-12 19:03:15,141 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 19:03:15,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-09-12 19:03:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 19:03:15,143 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:03:15,143 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:03:15,155 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:03:15,343 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:03:15,344 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:03:15,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:15,344 INFO L85 PathProgramCache]: Analyzing trace with hash 452691078, now seen corresponding path program 1 times [2024-09-12 19:03:15,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:03:15,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579128933] [2024-09-12 19:03:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:15,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:03:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:15,414 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:03:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:15,429 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:03:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:15,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:03:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:15,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:03:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 19:03:15,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:03:15,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579128933] [2024-09-12 19:03:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579128933] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:03:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878144682] [2024-09-12 19:03:15,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:15,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:03:15,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:03:15,486 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:03:15,487 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:03:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:15,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 19:03:15,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:03:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 19:03:15,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:03:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 19:03:15,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878144682] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:03:15,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:03:15,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2024-09-12 19:03:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631746243] [2024-09-12 19:03:15,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:03:15,636 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 19:03:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:03:15,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 19:03:15,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:03:15,637 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 19:03:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:03:15,716 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-09-12 19:03:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:03:15,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 27 [2024-09-12 19:03:15,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:03:15,719 INFO L225 Difference]: With dead ends: 40 [2024-09-12 19:03:15,720 INFO L226 Difference]: Without dead ends: 39 [2024-09-12 19:03:15,721 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:03:15,722 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:03:15,722 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 56 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:03:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-12 19:03:15,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-12 19:03:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.25) internal successors, (30), 29 states have internal predecessors, (30), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 19:03:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-09-12 19:03:15,733 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 27 [2024-09-12 19:03:15,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:03:15,734 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-09-12 19:03:15,734 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 19:03:15,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-09-12 19:03:15,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 19:03:15,735 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:03:15,735 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:03:15,747 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 19:03:15,935 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:03:15,936 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:03:15,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:15,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1148521603, now seen corresponding path program 1 times [2024-09-12 19:03:15,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:03:15,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845464938] [2024-09-12 19:03:15,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:03:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:15,980 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:03:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:15,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:03:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:15,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:03:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:15,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:03:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:03:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:03:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845464938] [2024-09-12 19:03:16,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845464938] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:03:16,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:03:16,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 19:03:16,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970845800] [2024-09-12 19:03:16,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:03:16,001 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 19:03:16,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:03:16,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 19:03:16,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:03:16,001 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:03:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:03:16,056 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-09-12 19:03:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:03:16,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-12 19:03:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:03:16,058 INFO L225 Difference]: With dead ends: 39 [2024-09-12 19:03:16,058 INFO L226 Difference]: Without dead ends: 38 [2024-09-12 19:03:16,058 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:03:16,058 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:03:16,058 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 30 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:03:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-12 19:03:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-12 19:03:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 19:03:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-09-12 19:03:16,064 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 28 [2024-09-12 19:03:16,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:03:16,064 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-09-12 19:03:16,064 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:03:16,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-09-12 19:03:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 19:03:16,065 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:03:16,065 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:03:16,065 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 19:03:16,065 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:03:16,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1148522885, now seen corresponding path program 1 times [2024-09-12 19:03:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:03:16,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982798699] [2024-09-12 19:03:16,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:03:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,149 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:03:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:03:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:03:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,162 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:03:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:03:16,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:03:16,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982798699] [2024-09-12 19:03:16,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982798699] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:03:16,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819125012] [2024-09-12 19:03:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:16,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:03:16,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:03:16,170 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:03:16,171 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:03:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 19:03:16,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:03:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:03:16,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:03:16,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819125012] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:03:16,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:03:16,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-09-12 19:03:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171471458] [2024-09-12 19:03:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:03:16,252 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:03:16,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:03:16,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:03:16,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:03:16,254 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:03:16,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:03:16,280 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-09-12 19:03:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 19:03:16,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-12 19:03:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:03:16,281 INFO L225 Difference]: With dead ends: 38 [2024-09-12 19:03:16,281 INFO L226 Difference]: Without dead ends: 37 [2024-09-12 19:03:16,281 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 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:03:16,282 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 49 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:03:16,282 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 49 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:03:16,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-12 19:03:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-12 19:03:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 27 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 19:03:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-09-12 19:03:16,291 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 28 [2024-09-12 19:03:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:03:16,291 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-09-12 19:03:16,291 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:03:16,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-09-12 19:03:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 19:03:16,292 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:03:16,292 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:03:16,310 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:03:16,492 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 19:03:16,492 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:03:16,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1244471122, now seen corresponding path program 1 times [2024-09-12 19:03:16,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:03:16,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686289362] [2024-09-12 19:03:16,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:16,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:03:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:03:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,592 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:03:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:03:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,600 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:03:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:03:16,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:03:16,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686289362] [2024-09-12 19:03:16,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686289362] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:03:16,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156984153] [2024-09-12 19:03:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:16,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:03:16,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:03:16,608 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:03:16,609 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:03:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:16,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 19:03:16,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:03:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:03:16,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:03:16,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156984153] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:03:16,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:03:16,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-09-12 19:03:16,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591199439] [2024-09-12 19:03:16,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:03:16,678 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:03:16,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:03:16,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:03:16,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:03:16,678 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:03:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:03:16,725 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-09-12 19:03:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:03:16,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-12 19:03:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:03:16,727 INFO L225 Difference]: With dead ends: 46 [2024-09-12 19:03:16,727 INFO L226 Difference]: Without dead ends: 43 [2024-09-12 19:03:16,727 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 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:03:16,728 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:03:16,728 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 72 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:03:16,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-12 19:03:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-09-12 19:03:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 19:03:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-09-12 19:03:16,739 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 29 [2024-09-12 19:03:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:03:16,740 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-09-12 19:03:16,741 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:03:16,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-09-12 19:03:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 19:03:16,742 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:03:16,742 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:03:16,762 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 19:03:16,943 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:03:16,943 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:03:16,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:16,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1301099919, now seen corresponding path program 1 times [2024-09-12 19:03:16,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:03:16,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231646310] [2024-09-12 19:03:16,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:16,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:03:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:17,101 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:03:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:17,103 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:03:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:17,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:03:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:17,107 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:03:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:03:17,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:03:17,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231646310] [2024-09-12 19:03:17,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231646310] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:03:17,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000050287] [2024-09-12 19:03:17,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:17,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:03:17,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:03:17,129 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:03:17,130 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:03:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:17,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 19:03:17,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:03:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:03:17,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:03:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:03:17,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000050287] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:03:17,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:03:17,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2024-09-12 19:03:17,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607421833] [2024-09-12 19:03:17,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:03:17,381 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 19:03:17,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:03:17,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 19:03:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-09-12 19:03:17,381 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 19:03:22,509 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:03:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:03:22,573 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2024-09-12 19:03:22,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 19:03:22,573 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-12 19:03:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:03:22,574 INFO L225 Difference]: With dead ends: 61 [2024-09-12 19:03:22,574 INFO L226 Difference]: Without dead ends: 48 [2024-09-12 19:03:22,575 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-09-12 19:03:22,576 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:03:22,576 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 130 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2024-09-12 19:03:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-12 19:03:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-09-12 19:03:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 19:03:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-09-12 19:03:22,596 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 32 [2024-09-12 19:03:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:03:22,596 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-09-12 19:03:22,597 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 19:03:22,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-09-12 19:03:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 19:03:22,597 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:03:22,598 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:03:22,618 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:03:22,798 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-12 19:03:22,799 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:03:22,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:03:22,799 INFO L85 PathProgramCache]: Analyzing trace with hash -657212111, now seen corresponding path program 1 times [2024-09-12 19:03:22,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:03:22,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872233569] [2024-09-12 19:03:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:22,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:03:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:03:22,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355760214] [2024-09-12 19:03:22,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:03:22,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:03:22,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:03:22,824 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:03:22,826 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:03:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:03:22,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-12 19:03:22,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:03:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:03:23,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:03:39,392 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* c_main_~x~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0) (* 18446744073709551615 c_main_~y~0) 1) 18446744073709551616) 0)) (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0) c_main_~z~0) 18446744073709551616) 0)) is different from true [2024-09-12 19:04:03,156 WARN L293 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 19:04:12,610 WARN L293 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 19:04:28,707 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0) c_main_~z~0) 18446744073709551616) 0)) (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~z~0 c_main_~z~0) (* c_main_~z~0 c_main_~z~0)) 18446744073709551616) 0)) is different from true [2024-09-12 19:04:38,516 WARN L293 SmtUtils]: Spent 5.79s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 19:05:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 16 not checked. [2024-09-12 19:05:12,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:05:12,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872233569] [2024-09-12 19:05:12,042 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:05:12,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355760214] [2024-09-12 19:05:12,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355760214] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:05:12,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:05:12,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-09-12 19:05:12,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943621280] [2024-09-12 19:05:12,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:05:12,043 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 19:05:12,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:05:12,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 19:05:12,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=198, Unknown=3, NotChecked=58, Total=306 [2024-09-12 19:05:12,043 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 15 states have internal predecessors, (51), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-12 19:05:18,051 WARN L293 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 19:05:22,065 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:05:34,116 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:05:38,121 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:05:42,127 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:05:46,135 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:05:50,139 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:05:54,142 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:05:58,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:06:02,197 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:06:06,199 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:06:10,209 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:06:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:06:10,212 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-09-12 19:06:10,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 19:06:10,213 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 15 states have internal predecessors, (51), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 44 [2024-09-12 19:06:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:06:10,215 INFO L225 Difference]: With dead ends: 78 [2024-09-12 19:06:10,215 INFO L226 Difference]: Without dead ends: 76 [2024-09-12 19:06:10,215 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=71, Invalid=274, Unknown=5, NotChecked=70, Total=420 [2024-09-12 19:06:10,215 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 12 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 44.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:06:10,215 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 272 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 182 Invalid, 11 Unknown, 139 Unchecked, 44.3s Time] [2024-09-12 19:06:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-12 19:06:10,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-09-12 19:06:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-12 19:06:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2024-09-12 19:06:10,250 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 44 [2024-09-12 19:06:10,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:06:10,250 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2024-09-12 19:06:10,250 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 15 states have internal predecessors, (51), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-12 19:06:10,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:06:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2024-09-12 19:06:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-12 19:06:10,251 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:06:10,251 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:06:10,264 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:06:10,455 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:06:10,456 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:06:10,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:06:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1580423951, now seen corresponding path program 1 times [2024-09-12 19:06:10,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:06:10,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056645779] [2024-09-12 19:06:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:06:10,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:06:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:06:10,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:06:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:06:10,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:06:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:06:10,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:06:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:06:10,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-12 19:06:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:06:10,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-12 19:06:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:06:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 19:06:10,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:06:10,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056645779] [2024-09-12 19:06:10,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056645779] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:06:10,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346121724] [2024-09-12 19:06:10,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:06:10,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:06:10,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:06:10,577 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:06:10,578 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:06:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:06:10,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 19:06:10,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:06:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:06:10,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:06:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 19:06:10,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346121724] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:06:10,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:06:10,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 18 [2024-09-12 19:06:10,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669131860] [2024-09-12 19:06:10,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:06:10,757 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-12 19:06:10,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:06:10,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-12 19:06:10,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-09-12 19:06:10,760 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 9 states have call successors, (18), 8 states have call predecessors, (18), 6 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-12 19:06:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:06:11,010 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-09-12 19:06:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-12 19:06:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 9 states have call successors, (18), 8 states have call predecessors, (18), 6 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) Word has length 46 [2024-09-12 19:06:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:06:11,012 INFO L225 Difference]: With dead ends: 90 [2024-09-12 19:06:11,012 INFO L226 Difference]: Without dead ends: 83 [2024-09-12 19:06:11,012 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=292, Invalid=830, Unknown=0, NotChecked=0, Total=1122 [2024-09-12 19:06:11,013 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 66 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:06:11,013 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 69 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:06:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-12 19:06:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-09-12 19:06:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-12 19:06:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2024-09-12 19:06:11,029 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 46 [2024-09-12 19:06:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:06:11,029 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2024-09-12 19:06:11,029 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 9 states have call successors, (18), 8 states have call predecessors, (18), 6 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-12 19:06:11,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:06:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2024-09-12 19:06:11,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-12 19:06:11,030 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:06:11,030 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:06:11,043 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:06:11,230 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:06:11,231 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-09-12 19:06:11,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:06:11,231 INFO L85 PathProgramCache]: Analyzing trace with hash 935416246, now seen corresponding path program 2 times [2024-09-12 19:06:11,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:06:11,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62376263] [2024-09-12 19:06:11,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:06:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:06:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:06:11,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1573950946] [2024-09-12 19:06:11,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:06:11,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:06:11,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:06:11,288 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:06:11,290 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-12 19:06:11,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:06:11,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:06:11,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-12 19:06:11,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:06:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 21 proven. 89 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-12 19:06:12,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:06:28,249 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* c_main_~x~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0) (* 18446744073709551615 c_main_~y~0) 1) 18446744073709551616) 0)) (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0) c_main_~z~0) 18446744073709551616) 0)) is different from true [2024-09-12 19:06:41,759 WARN L293 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 19:07:14,088 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0) c_main_~z~0) 18446744073709551616) 0)) (= (mod (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~x~0 c_main_~z~0 c_main_~z~0) (* 18446744073709551615 c_main_~y~0 c_main_~z~0 c_main_~z~0) (* c_main_~z~0 c_main_~z~0)) 18446744073709551616) 0)) is different from true