./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.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/ps6-ll_valuebound2.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 dbc7fc96c6d4708331280184201322c719c7fb1504d84fafd0b9583653597d2e --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:42:19,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:42:19,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:42:19,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:42:19,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:42:19,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:42:19,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:42:19,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:42:19,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:42:19,665 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:42:19,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:42:19,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:42:19,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:42:19,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:42:19,668 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:42:19,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:42:19,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:42:19,669 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:42:19,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:42:19,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:42:19,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:42:19,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:42:19,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:42:19,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:42:19,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:42:19,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:42:19,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:42:19,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:42:19,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:42:19,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:42:19,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:42:19,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:42:19,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:42:19,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:42:19,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:42:19,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:42:19,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:42:19,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:42:19,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:42:19,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:42:19,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:42:19,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:42:19,680 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 -> dbc7fc96c6d4708331280184201322c719c7fb1504d84fafd0b9583653597d2e 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:42:19,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:42:19,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:42:19,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:42:19,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:42:19,993 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:42:19,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c [2024-09-12 19:42:21,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:42:21,518 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:42:21,518 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound2.c [2024-09-12 19:42:21,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/628d7a8e4/6b99ab1fa87f40188f1217aba4b70d4a/FLAGd3f4870ad [2024-09-12 19:42:21,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/628d7a8e4/6b99ab1fa87f40188f1217aba4b70d4a [2024-09-12 19:42:21,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:42:21,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:42:21,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:42:21,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:42:21,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:42:21,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:42:21" (1/1) ... [2024-09-12 19:42:21,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fdcd0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:21, skipping insertion in model container [2024-09-12 19:42:21,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:42:21" (1/1) ... [2024-09-12 19:42:21,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:42:22,085 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/ps6-ll_valuebound2.c[458,471] [2024-09-12 19:42:22,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:42:22,121 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:42:22,130 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/ps6-ll_valuebound2.c[458,471] [2024-09-12 19:42:22,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:42:22,157 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:42:22,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:22 WrapperNode [2024-09-12 19:42:22,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:42:22,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:42:22,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:42:22,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:42:22,163 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:42:22" (1/1) ... [2024-09-12 19:42:22,170 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:42:22" (1/1) ... [2024-09-12 19:42:22,178 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:42:22,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:42:22,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:42:22,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:42:22,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:42:22,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:22" (1/1) ... [2024-09-12 19:42:22,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:22" (1/1) ... [2024-09-12 19:42:22,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:22" (1/1) ... [2024-09-12 19:42:22,208 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:42:22,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:22" (1/1) ... [2024-09-12 19:42:22,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:22" (1/1) ... [2024-09-12 19:42:22,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:22" (1/1) ... [2024-09-12 19:42:22,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:22" (1/1) ... [2024-09-12 19:42:22,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:22" (1/1) ... [2024-09-12 19:42:22,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:22" (1/1) ... [2024-09-12 19:42:22,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:42:22,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:42:22,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:42:22,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:42:22,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:22" (1/1) ... [2024-09-12 19:42:22,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:42:22,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:42:22,274 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:42:22,282 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:42:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:42:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 19:42:22,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 19:42:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:42:22,315 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:42:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:42:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:42:22,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:42:22,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:42:22,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:42:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 19:42:22,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 19:42:22,360 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:42:22,361 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:42:22,801 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-09-12 19:42:22,801 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:42:22,822 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:42:22,824 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 19:42:22,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:42:22 BoogieIcfgContainer [2024-09-12 19:42:22,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:42:22,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:42:22,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:42:22,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:42:22,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:42:21" (1/3) ... [2024-09-12 19:42:22,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8aa1422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:42:22, skipping insertion in model container [2024-09-12 19:42:22,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:42:22" (2/3) ... [2024-09-12 19:42:22,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8aa1422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:42:22, skipping insertion in model container [2024-09-12 19:42:22,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:42:22" (3/3) ... [2024-09-12 19:42:22,832 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound2.c [2024-09-12 19:42:22,845 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:42:22,845 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2024-09-12 19:42:22,905 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:42:22,910 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;@7e1e91ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:42:22,910 INFO L337 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2024-09-12 19:42:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 116 states have (on average 1.9310344827586208) internal successors, (224), 219 states have internal predecessors, (224), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 19:42:22,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 19:42:22,919 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:42:22,920 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:42:22,920 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2024-09-12 19:42:22,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:22,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2038027279, now seen corresponding path program 1 times [2024-09-12 19:42:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:42:22,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993952660] [2024-09-12 19:42:22,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:42:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:23,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:42:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:23,035 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:42:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:23,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:42:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:23,044 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:42:23,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:42:23,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993952660] [2024-09-12 19:42:23,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993952660] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:42:23,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:42:23,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:42:23,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068846411] [2024-09-12 19:42:23,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:42:23,050 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 19:42:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:42:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 19:42:23,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 19:42:23,070 INFO L87 Difference]: Start difference. First operand has 231 states, 116 states have (on average 1.9310344827586208) internal successors, (224), 219 states have internal predecessors, (224), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:42:23,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:42:23,129 INFO L93 Difference]: Finished difference Result 431 states and 474 transitions. [2024-09-12 19:42:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 19:42:23,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2024-09-12 19:42:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:42:23,139 INFO L225 Difference]: With dead ends: 431 [2024-09-12 19:42:23,139 INFO L226 Difference]: Without dead ends: 202 [2024-09-12 19:42:23,143 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 19:42:23,145 INFO L434 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:42:23,146 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:42:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-09-12 19:42:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-09-12 19:42:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 192 states have internal predecessors, (193), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 19:42:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 205 transitions. [2024-09-12 19:42:23,191 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 205 transitions. Word has length 18 [2024-09-12 19:42:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:42:23,193 INFO L474 AbstractCegarLoop]: Abstraction has 202 states and 205 transitions. [2024-09-12 19:42:23,193 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:42:23,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 205 transitions. [2024-09-12 19:42:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 19:42:23,198 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:42:23,198 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:42:23,198 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 19:42:23,199 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2024-09-12 19:42:23,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1279708240, now seen corresponding path program 1 times [2024-09-12 19:42:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:42:23,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136893426] [2024-09-12 19:42:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:23,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:42:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:23,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:42:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:23,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:42:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:23,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:42:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:23,290 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:42:23,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:42:23,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136893426] [2024-09-12 19:42:23,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136893426] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:42:23,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:42:23,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:42:23,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507979733] [2024-09-12 19:42:23,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:42:23,292 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:42:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:42:23,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:42:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:42:23,294 INFO L87 Difference]: Start difference. First operand 202 states and 205 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 19:42:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:42:23,675 INFO L93 Difference]: Finished difference Result 364 states and 374 transitions. [2024-09-12 19:42:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:42:23,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2024-09-12 19:42:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:42:23,677 INFO L225 Difference]: With dead ends: 364 [2024-09-12 19:42:23,678 INFO L226 Difference]: Without dead ends: 305 [2024-09-12 19:42:23,678 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:42:23,679 INFO L434 NwaCegarLoop]: 114 mSDtfsCounter, 99 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:42:23,679 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 149 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:42:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-09-12 19:42:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 298. [2024-09-12 19:42:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 208 states have (on average 1.4326923076923077) internal successors, (298), 286 states have internal predecessors, (298), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 19:42:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 314 transitions. [2024-09-12 19:42:23,710 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 314 transitions. Word has length 18 [2024-09-12 19:42:23,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:42:23,712 INFO L474 AbstractCegarLoop]: Abstraction has 298 states and 314 transitions. [2024-09-12 19:42:23,712 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 19:42:23,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 314 transitions. [2024-09-12 19:42:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-12 19:42:23,714 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:42:23,715 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:42:23,715 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:42:23,715 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2024-09-12 19:42:23,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1658326006, now seen corresponding path program 1 times [2024-09-12 19:42:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:42:23,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799929250] [2024-09-12 19:42:23,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:23,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:42:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:23,822 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:42:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:23,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:42:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:23,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:42:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:23,835 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:42:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:42:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799929250] [2024-09-12 19:42:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799929250] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:42:23,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:42:23,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:42:23,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803672176] [2024-09-12 19:42:23,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:42:23,836 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:42:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:42:23,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:42:23,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:42:23,837 INFO L87 Difference]: Start difference. First operand 298 states and 314 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 19:42:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:42:23,911 INFO L93 Difference]: Finished difference Result 323 states and 333 transitions. [2024-09-12 19:42:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:42:23,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-09-12 19:42:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:42:23,913 INFO L225 Difference]: With dead ends: 323 [2024-09-12 19:42:23,914 INFO L226 Difference]: Without dead ends: 317 [2024-09-12 19:42:23,914 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:42:23,915 INFO L434 NwaCegarLoop]: 190 mSDtfsCounter, 73 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:42:23,918 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 372 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:42:23,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-09-12 19:42:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 298. [2024-09-12 19:42:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 208 states have (on average 1.4038461538461537) internal successors, (292), 286 states have internal predecessors, (292), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 19:42:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 308 transitions. [2024-09-12 19:42:23,951 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 308 transitions. Word has length 56 [2024-09-12 19:42:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:42:23,951 INFO L474 AbstractCegarLoop]: Abstraction has 298 states and 308 transitions. [2024-09-12 19:42:23,951 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 19:42:23,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 308 transitions. [2024-09-12 19:42:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-12 19:42:23,953 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:42:23,953 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:42:23,953 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 19:42:23,953 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2024-09-12 19:42:23,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:23,954 INFO L85 PathProgramCache]: Analyzing trace with hash 218429272, now seen corresponding path program 1 times [2024-09-12 19:42:23,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:42:23,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413958184] [2024-09-12 19:42:23,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:23,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:42:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:24,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:42:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:24,084 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:42:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:24,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:42:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:24,088 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:42:24,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:42:24,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413958184] [2024-09-12 19:42:24,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413958184] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:42:24,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:42:24,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 19:42:24,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168834014] [2024-09-12 19:42:24,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:42:24,089 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 19:42:24,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:42:24,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 19:42:24,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:42:24,090 INFO L87 Difference]: Start difference. First operand 298 states and 308 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 19:42:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:42:25,345 INFO L93 Difference]: Finished difference Result 319 states and 327 transitions. [2024-09-12 19:42:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 19:42:25,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2024-09-12 19:42:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:42:25,347 INFO L225 Difference]: With dead ends: 319 [2024-09-12 19:42:25,347 INFO L226 Difference]: Without dead ends: 317 [2024-09-12 19:42:25,348 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:42:25,349 INFO L434 NwaCegarLoop]: 110 mSDtfsCounter, 108 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:42:25,349 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 319 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-09-12 19:42:25,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-09-12 19:42:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 298. [2024-09-12 19:42:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 208 states have (on average 1.3942307692307692) internal successors, (290), 286 states have internal predecessors, (290), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 19:42:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 306 transitions. [2024-09-12 19:42:25,385 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 306 transitions. Word has length 58 [2024-09-12 19:42:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:42:25,386 INFO L474 AbstractCegarLoop]: Abstraction has 298 states and 306 transitions. [2024-09-12 19:42:25,386 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 19:42:25,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 306 transitions. [2024-09-12 19:42:25,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-12 19:42:25,387 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:42:25,388 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:42:25,388 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 19:42:25,388 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2024-09-12 19:42:25,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:25,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1864924573, now seen corresponding path program 1 times [2024-09-12 19:42:25,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:42:25,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471025618] [2024-09-12 19:42:25,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:25,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:42:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:42:25,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784602441] [2024-09-12 19:42:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:25,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:42:25,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:42:25,409 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:42:25,411 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:42:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:25,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 19:42:25,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:42:25,663 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:42:25,664 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:42:25,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:42:25,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471025618] [2024-09-12 19:42:25,664 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:42:25,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784602441] [2024-09-12 19:42:25,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784602441] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:42:25,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:42:25,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:42:25,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785965176] [2024-09-12 19:42:25,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:42:25,666 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:42:25,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:42:25,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:42:25,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:42:25,666 INFO L87 Difference]: Start difference. First operand 298 states and 306 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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:42:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:42:26,041 INFO L93 Difference]: Finished difference Result 307 states and 312 transitions. [2024-09-12 19:42:26,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:42:26,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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 63 [2024-09-12 19:42:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:42:26,044 INFO L225 Difference]: With dead ends: 307 [2024-09-12 19:42:26,044 INFO L226 Difference]: Without dead ends: 257 [2024-09-12 19:42:26,044 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 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:42:26,045 INFO L434 NwaCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:42:26,045 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 352 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:42:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-09-12 19:42:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2024-09-12 19:42:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 165 states have (on average 1.490909090909091) internal successors, (246), 243 states have internal predecessors, (246), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 19:42:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 260 transitions. [2024-09-12 19:42:26,070 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 260 transitions. Word has length 63 [2024-09-12 19:42:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:42:26,071 INFO L474 AbstractCegarLoop]: Abstraction has 255 states and 260 transitions. [2024-09-12 19:42:26,072 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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:42:26,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:26,072 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 260 transitions. [2024-09-12 19:42:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-09-12 19:42:26,073 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:42:26,073 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:42:26,088 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 19:42:26,274 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:42:26,275 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2024-09-12 19:42:26,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1734009797, now seen corresponding path program 1 times [2024-09-12 19:42:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:42:26,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300833212] [2024-09-12 19:42:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:42:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:26,325 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:42:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:26,327 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:42:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:26,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:42:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:26,330 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 19:42:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:26,333 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:42:26,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:42:26,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300833212] [2024-09-12 19:42:26,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300833212] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:42:26,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:42:26,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:42:26,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046591318] [2024-09-12 19:42:26,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:42:26,334 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:42:26,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:42:26,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:42:26,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:42:26,335 INFO L87 Difference]: Start difference. First operand 255 states and 260 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 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:42:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:42:26,384 INFO L93 Difference]: Finished difference Result 257 states and 260 transitions. [2024-09-12 19:42:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:42:26,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 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 66 [2024-09-12 19:42:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:42:26,387 INFO L225 Difference]: With dead ends: 257 [2024-09-12 19:42:26,387 INFO L226 Difference]: Without dead ends: 255 [2024-09-12 19:42:26,388 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:42:26,388 INFO L434 NwaCegarLoop]: 201 mSDtfsCounter, 1 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:42:26,388 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:42:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-09-12 19:42:26,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-09-12 19:42:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 165 states have (on average 1.4787878787878788) internal successors, (244), 243 states have internal predecessors, (244), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 19:42:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 258 transitions. [2024-09-12 19:42:26,410 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 258 transitions. Word has length 66 [2024-09-12 19:42:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:42:26,411 INFO L474 AbstractCegarLoop]: Abstraction has 255 states and 258 transitions. [2024-09-12 19:42:26,411 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 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:42:26,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 258 transitions. [2024-09-12 19:42:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-09-12 19:42:26,412 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:42:26,412 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:42:26,412 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 19:42:26,412 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2024-09-12 19:42:26,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash -710913228, now seen corresponding path program 1 times [2024-09-12 19:42:26,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:42:26,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986808509] [2024-09-12 19:42:26,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:26,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:42:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:42:26,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098509205] [2024-09-12 19:42:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:26,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:42:26,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:42:26,425 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:42:26,427 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:42:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:26,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 19:42:26,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:42:26,531 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:42:26,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:42:26,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:42:26,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986808509] [2024-09-12 19:42:26,532 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:42:26,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098509205] [2024-09-12 19:42:26,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098509205] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:42:26,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:42:26,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 19:42:26,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317576576] [2024-09-12 19:42:26,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:42:26,533 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 19:42:26,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:42:26,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 19:42:26,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:42:26,534 INFO L87 Difference]: Start difference. First operand 255 states and 258 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (5), 1 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:42:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:42:26,902 INFO L93 Difference]: Finished difference Result 431 states and 445 transitions. [2024-09-12 19:42:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 19:42:26,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (5), 1 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 71 [2024-09-12 19:42:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:42:26,905 INFO L225 Difference]: With dead ends: 431 [2024-09-12 19:42:26,905 INFO L226 Difference]: Without dead ends: 368 [2024-09-12 19:42:26,905 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:42:26,906 INFO L434 NwaCegarLoop]: 108 mSDtfsCounter, 109 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:42:26,906 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 177 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:42:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-09-12 19:42:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 361. [2024-09-12 19:42:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 269 states have (on average 1.3494423791821561) internal successors, (363), 347 states have internal predecessors, (363), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 19:42:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 381 transitions. [2024-09-12 19:42:26,940 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 381 transitions. Word has length 71 [2024-09-12 19:42:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:42:26,940 INFO L474 AbstractCegarLoop]: Abstraction has 361 states and 381 transitions. [2024-09-12 19:42:26,940 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (5), 1 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:42:26,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 381 transitions. [2024-09-12 19:42:26,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-09-12 19:42:26,941 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:42:26,941 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:42:26,956 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:42:27,145 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 19:42:27,146 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2024-09-12 19:42:27,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1465191407, now seen corresponding path program 1 times [2024-09-12 19:42:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:42:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850104117] [2024-09-12 19:42:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:42:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:27,244 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:42:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:27,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:42:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:27,250 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:42:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:27,252 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 19:42:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:27,257 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:42:27,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:42:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850104117] [2024-09-12 19:42:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850104117] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:42:27,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:42:27,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 19:42:27,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345299496] [2024-09-12 19:42:27,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:42:27,257 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 19:42:27,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:42:27,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 19:42:27,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:42:27,258 INFO L87 Difference]: Start difference. First operand 361 states and 381 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (5), 1 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:42:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:42:27,352 INFO L93 Difference]: Finished difference Result 362 states and 381 transitions. [2024-09-12 19:42:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:42:27,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (5), 1 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 78 [2024-09-12 19:42:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:42:27,354 INFO L225 Difference]: With dead ends: 362 [2024-09-12 19:42:27,354 INFO L226 Difference]: Without dead ends: 361 [2024-09-12 19:42:27,355 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:42:27,355 INFO L434 NwaCegarLoop]: 149 mSDtfsCounter, 55 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:42:27,355 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 331 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:42:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-09-12 19:42:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-09-12 19:42:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 269 states have (on average 1.345724907063197) internal successors, (362), 347 states have internal predecessors, (362), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 19:42:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 380 transitions. [2024-09-12 19:42:27,381 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 380 transitions. Word has length 78 [2024-09-12 19:42:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:42:27,381 INFO L474 AbstractCegarLoop]: Abstraction has 361 states and 380 transitions. [2024-09-12 19:42:27,381 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (5), 1 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:42:27,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 380 transitions. [2024-09-12 19:42:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-12 19:42:27,383 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:42:27,383 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:42:27,383 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 19:42:27,383 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2024-09-12 19:42:27,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1823706812, now seen corresponding path program 1 times [2024-09-12 19:42:27,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:42:27,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018461365] [2024-09-12 19:42:27,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:27,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:42:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:27,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:42:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:27,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:42:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:27,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:42:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:27,472 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-12 19:42:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:27,477 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:42:27,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:42:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018461365] [2024-09-12 19:42:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018461365] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:42:27,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:42:27,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 19:42:27,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271721990] [2024-09-12 19:42:27,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:42:27,478 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 19:42:27,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:42:27,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 19:42:27,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:42:27,479 INFO L87 Difference]: Start difference. First operand 361 states and 380 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:42:31,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:42:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:42:31,472 INFO L93 Difference]: Finished difference Result 362 states and 380 transitions. [2024-09-12 19:42:31,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 19:42:31,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 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 79 [2024-09-12 19:42:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:42:31,474 INFO L225 Difference]: With dead ends: 362 [2024-09-12 19:42:31,474 INFO L226 Difference]: Without dead ends: 361 [2024-09-12 19:42:31,474 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:42:31,475 INFO L434 NwaCegarLoop]: 158 mSDtfsCounter, 47 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:42:31,475 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 367 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-09-12 19:42:31,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-09-12 19:42:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-09-12 19:42:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 269 states have (on average 1.342007434944238) internal successors, (361), 347 states have internal predecessors, (361), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 19:42:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 379 transitions. [2024-09-12 19:42:31,495 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 379 transitions. Word has length 79 [2024-09-12 19:42:31,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:42:31,496 INFO L474 AbstractCegarLoop]: Abstraction has 361 states and 379 transitions. [2024-09-12 19:42:31,496 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:42:31,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:31,496 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 379 transitions. [2024-09-12 19:42:31,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-09-12 19:42:31,497 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:42:31,497 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:42:31,497 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 19:42:31,497 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2024-09-12 19:42:31,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash -205124508, now seen corresponding path program 1 times [2024-09-12 19:42:31,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:42:31,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878181447] [2024-09-12 19:42:31,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:31,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:42:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:42:31,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1031415064] [2024-09-12 19:42:31,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:31,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:42:31,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:42:31,518 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:42:31,519 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:42:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:31,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 19:42:31,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:42:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:42:31,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:42:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:42:31,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:42:31,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878181447] [2024-09-12 19:42:31,990 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:42:31,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031415064] [2024-09-12 19:42:31,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031415064] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:42:31,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:42:31,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-09-12 19:42:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064178642] [2024-09-12 19:42:31,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:42:31,991 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 19:42:31,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:42:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 19:42:31,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:42:31,992 INFO L87 Difference]: Start difference. First operand 361 states and 379 transitions. Second operand has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 19:42:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:42:32,811 INFO L93 Difference]: Finished difference Result 386 states and 398 transitions. [2024-09-12 19:42:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 19:42:32,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 119 [2024-09-12 19:42:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:42:32,817 INFO L225 Difference]: With dead ends: 386 [2024-09-12 19:42:32,817 INFO L226 Difference]: Without dead ends: 377 [2024-09-12 19:42:32,818 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:42:32,818 INFO L434 NwaCegarLoop]: 62 mSDtfsCounter, 399 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 19:42:32,818 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 197 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 19:42:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-09-12 19:42:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 365. [2024-09-12 19:42:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 276 states have (on average 1.3115942028985508) internal successors, (362), 351 states have internal predecessors, (362), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 19:42:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 380 transitions. [2024-09-12 19:42:32,851 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 380 transitions. Word has length 119 [2024-09-12 19:42:32,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:42:32,851 INFO L474 AbstractCegarLoop]: Abstraction has 365 states and 380 transitions. [2024-09-12 19:42:32,852 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 19:42:32,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:32,852 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 380 transitions. [2024-09-12 19:42:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-09-12 19:42:32,853 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:42:32,853 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:42:32,866 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 19:42:33,053 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 19:42:33,054 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2024-09-12 19:42:33,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:42:33,054 INFO L85 PathProgramCache]: Analyzing trace with hash 443847750, now seen corresponding path program 1 times [2024-09-12 19:42:33,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:42:33,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361766374] [2024-09-12 19:42:33,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:33,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:42:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:42:33,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210350018] [2024-09-12 19:42:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:42:33,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:42:33,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:42:33,073 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:42:33,074 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:42:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:42:33,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 19:42:33,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:42:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:42:33,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:42:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:42:34,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:42:34,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361766374] [2024-09-12 19:42:34,391 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:42:34,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210350018] [2024-09-12 19:42:34,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210350018] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:42:34,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:42:34,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2024-09-12 19:42:34,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659962594] [2024-09-12 19:42:34,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:42:34,392 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 19:42:34,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:42:34,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 19:42:34,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:42:34,393 INFO L87 Difference]: Start difference. First operand 365 states and 380 transitions. Second operand has 9 states, 8 states have (on average 26.25) internal successors, (210), 9 states have internal predecessors, (210), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 19:42:39,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.89s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:42:45,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:42:57,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 11.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:43:06,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:43:12,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:43:14,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:43:18,287 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:43:21,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:43:25,036 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:43:30,437 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:43:35,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:43:36,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:43:52,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 14.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:43:57,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:44:04,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:44:08,314 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:44:12,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:44:18,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.96s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:44:24,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:44:29,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:44:35,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:44:38,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:44:42,791 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:44:47,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:44:52,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:44:54,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:44:57,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:45:06,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:45:11,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:45:16,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:45:24,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:45:30,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.99s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:45:34,809 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:45:39,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:45:45,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:45:50,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:45:56,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:46:03,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:46:06,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:46:10,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:46:14,355 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:46:20,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:46:25,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:46:31,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:46:33,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:46:39,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:46:47,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:46:51,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:46:55,939 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:46:58,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:47:04,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:47:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:47:05,194 INFO L93 Difference]: Finished difference Result 377 states and 386 transitions. [2024-09-12 19:47:05,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 19:47:05,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 26.25) internal successors, (210), 9 states have internal predecessors, (210), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 121 [2024-09-12 19:47:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:47:05,196 INFO L225 Difference]: With dead ends: 377 [2024-09-12 19:47:05,196 INFO L226 Difference]: Without dead ends: 375 [2024-09-12 19:47:05,197 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2024-09-12 19:47:05,197 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 196 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 104 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 270.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 270.5s IncrementalHoareTripleChecker+Time [2024-09-12 19:47:05,197 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 145 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 968 Invalid, 41 Unknown, 0 Unchecked, 270.5s Time] [2024-09-12 19:47:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-09-12 19:47:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2024-09-12 19:47:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 276 states have (on average 1.2971014492753623) internal successors, (358), 349 states have internal predecessors, (358), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 19:47:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 376 transitions. [2024-09-12 19:47:05,270 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 376 transitions. Word has length 121 [2024-09-12 19:47:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:47:05,271 INFO L474 AbstractCegarLoop]: Abstraction has 363 states and 376 transitions. [2024-09-12 19:47:05,271 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 26.25) internal successors, (210), 9 states have internal predecessors, (210), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-12 19:47:05,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:47:05,271 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 376 transitions. [2024-09-12 19:47:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-09-12 19:47:05,273 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:47:05,274 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:47:05,300 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 19:47:05,474 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:47:05,474 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2024-09-12 19:47:05,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:47:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1525336629, now seen corresponding path program 1 times [2024-09-12 19:47:05,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:47:05,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475347577] [2024-09-12 19:47:05,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:47:05,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:47:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:47:05,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32667083] [2024-09-12 19:47:05,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:47:05,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:47:05,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:47:05,497 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:47:05,499 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:47:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:47:05,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 19:47:05,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:47:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:47:05,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:47:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-09-12 19:47:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:47:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475347577] [2024-09-12 19:47:06,049 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:47:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32667083] [2024-09-12 19:47:06,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32667083] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 19:47:06,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:47:06,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2024-09-12 19:47:06,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405274232] [2024-09-12 19:47:06,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:47:06,050 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:47:06,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:47:06,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:47:06,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:47:06,050 INFO L87 Difference]: Start difference. First operand 363 states and 376 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)