./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/trex04.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/loops/trex04.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 f70ffe9cd45c37f44e9e780e31340fab45b6a2fb7f7ef23a2d90faf4241229d6 --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 17:53:04,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 17:53:05,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 17:53:05,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 17:53:05,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 17:53:05,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 17:53:05,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 17:53:05,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 17:53:05,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 17:53:05,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 17:53:05,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 17:53:05,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 17:53:05,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 17:53:05,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 17:53:05,084 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 17:53:05,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 17:53:05,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 17:53:05,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 17:53:05,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 17:53:05,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 17:53:05,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 17:53:05,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 17:53:05,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 17:53:05,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 17:53:05,091 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 17:53:05,091 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 17:53:05,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 17:53:05,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 17:53:05,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 17:53:05,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 17:53:05,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 17:53:05,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 17:53:05,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:53:05,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 17:53:05,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 17:53:05,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 17:53:05,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 17:53:05,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 17:53:05,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 17:53:05,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 17:53:05,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 17:53:05,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 17:53:05,096 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 -> f70ffe9cd45c37f44e9e780e31340fab45b6a2fb7f7ef23a2d90faf4241229d6 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 17:53:05,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 17:53:05,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 17:53:05,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 17:53:05,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 17:53:05,358 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 17:53:05,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/trex04.c [2024-09-12 17:53:06,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 17:53:06,809 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 17:53:06,810 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/trex04.c [2024-09-12 17:53:06,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/547c50959/9188714572b34c0bad7f4526904bdc01/FLAG6ad909113 [2024-09-12 17:53:07,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/547c50959/9188714572b34c0bad7f4526904bdc01 [2024-09-12 17:53:07,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 17:53:07,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 17:53:07,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 17:53:07,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 17:53:07,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 17:53:07,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6008913f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07, skipping insertion in model container [2024-09-12 17:53:07,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 17:53:07,390 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/loops/trex04.c[405,418] [2024-09-12 17:53:07,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:53:07,414 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 17:53:07,423 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/loops/trex04.c[405,418] [2024-09-12 17:53:07,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:53:07,444 INFO L204 MainTranslator]: Completed translation [2024-09-12 17:53:07,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07 WrapperNode [2024-09-12 17:53:07,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 17:53:07,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 17:53:07,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 17:53:07,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 17:53:07,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,467 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 17:53:07,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 17:53:07,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 17:53:07,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 17:53:07,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 17:53:07,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,489 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 17:53:07,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 17:53:07,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 17:53:07,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 17:53:07,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 17:53:07,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (1/1) ... [2024-09-12 17:53:07,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:53:07,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:53:07,529 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 17:53:07,531 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 17:53:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 17:53:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2024-09-12 17:53:07,565 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2024-09-12 17:53:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 17:53:07,565 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 17:53:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 17:53:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 17:53:07,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 17:53:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 17:53:07,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 17:53:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 17:53:07,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 17:53:07,621 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 17:53:07,622 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 17:53:07,792 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-09-12 17:53:07,792 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 17:53:07,806 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 17:53:07,806 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 17:53:07,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:53:07 BoogieIcfgContainer [2024-09-12 17:53:07,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 17:53:07,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 17:53:07,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 17:53:07,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 17:53:07,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 05:53:07" (1/3) ... [2024-09-12 17:53:07,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e859969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:53:07, skipping insertion in model container [2024-09-12 17:53:07,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:53:07" (2/3) ... [2024-09-12 17:53:07,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e859969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:53:07, skipping insertion in model container [2024-09-12 17:53:07,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:53:07" (3/3) ... [2024-09-12 17:53:07,813 INFO L112 eAbstractionObserver]: Analyzing ICFG trex04.c [2024-09-12 17:53:07,824 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 17:53:07,825 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-09-12 17:53:07,873 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 17:53:07,880 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;@73f1aca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 17:53:07,881 INFO L337 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-09-12 17:53:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 47 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 17:53:07,890 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:07,891 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:07,892 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:07,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:07,899 INFO L85 PathProgramCache]: Analyzing trace with hash -157120623, now seen corresponding path program 1 times [2024-09-12 17:53:07,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:07,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932967749] [2024-09-12 17:53:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:07,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:08,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:08,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932967749] [2024-09-12 17:53:08,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932967749] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:08,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:08,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 17:53:08,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933840941] [2024-09-12 17:53:08,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:08,053 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 17:53:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:08,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 17:53:08,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:53:08,082 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 47 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:08,136 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2024-09-12 17:53:08,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 17:53:08,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-12 17:53:08,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:08,145 INFO L225 Difference]: With dead ends: 81 [2024-09-12 17:53:08,145 INFO L226 Difference]: Without dead ends: 58 [2024-09-12 17:53:08,147 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 17:53:08,152 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 16 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:08,153 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 95 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-12 17:53:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-09-12 17:53:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.588235294117647) internal successors, (54), 48 states have internal predecessors, (54), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2024-09-12 17:53:08,192 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 8 [2024-09-12 17:53:08,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:08,193 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2024-09-12 17:53:08,193 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:08,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2024-09-12 17:53:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 17:53:08,195 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:08,196 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:08,196 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 17:53:08,196 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:08,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:08,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1458378928, now seen corresponding path program 1 times [2024-09-12 17:53:08,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:08,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112666063] [2024-09-12 17:53:08,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:08,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,347 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:08,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:08,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112666063] [2024-09-12 17:53:08,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112666063] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:08,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:08,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:53:08,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485036797] [2024-09-12 17:53:08,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:08,355 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:53:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:08,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:53:08,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:53:08,357 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:08,387 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2024-09-12 17:53:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:53:08,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 17:53:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:08,389 INFO L225 Difference]: With dead ends: 59 [2024-09-12 17:53:08,390 INFO L226 Difference]: Without dead ends: 55 [2024-09-12 17:53:08,390 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 17:53:08,391 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:08,391 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 128 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:08,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-12 17:53:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-12 17:53:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 49 states have internal predecessors, (56), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2024-09-12 17:53:08,398 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 12 [2024-09-12 17:53:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:08,399 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-09-12 17:53:08,399 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:08,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2024-09-12 17:53:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 17:53:08,400 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:08,400 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:08,400 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 17:53:08,400 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:08,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2034887427, now seen corresponding path program 1 times [2024-09-12 17:53:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:08,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768060167] [2024-09-12 17:53:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:08,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:08,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:08,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768060167] [2024-09-12 17:53:08,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768060167] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:08,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:08,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:53:08,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815635535] [2024-09-12 17:53:08,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:08,476 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:53:08,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:08,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:53:08,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:53:08,477 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:08,511 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2024-09-12 17:53:08,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:53:08,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-12 17:53:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:08,513 INFO L225 Difference]: With dead ends: 59 [2024-09-12 17:53:08,513 INFO L226 Difference]: Without dead ends: 57 [2024-09-12 17:53:08,513 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 17:53:08,514 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:08,514 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 125 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-12 17:53:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-12 17:53:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 51 states have internal predecessors, (58), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2024-09-12 17:53:08,522 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 13 [2024-09-12 17:53:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:08,522 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-09-12 17:53:08,522 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:08,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2024-09-12 17:53:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 17:53:08,523 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:08,523 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:08,524 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 17:53:08,524 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:08,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:08,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1993420183, now seen corresponding path program 1 times [2024-09-12 17:53:08,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:08,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222870093] [2024-09-12 17:53:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:08,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,602 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:08,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:08,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222870093] [2024-09-12 17:53:08,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222870093] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:08,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:08,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:53:08,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973750566] [2024-09-12 17:53:08,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:08,611 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:53:08,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:08,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:53:08,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:53:08,612 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:08,653 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2024-09-12 17:53:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:53:08,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-12 17:53:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:08,655 INFO L225 Difference]: With dead ends: 64 [2024-09-12 17:53:08,655 INFO L226 Difference]: Without dead ends: 63 [2024-09-12 17:53:08,655 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 17:53:08,656 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:08,656 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 112 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-12 17:53:08,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2024-09-12 17:53:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.5) internal successors, (63), 54 states have internal predecessors, (63), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2024-09-12 17:53:08,663 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 13 [2024-09-12 17:53:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:08,663 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2024-09-12 17:53:08,664 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:08,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2024-09-12 17:53:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 17:53:08,665 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:08,665 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:08,665 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 17:53:08,665 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:08,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:08,665 INFO L85 PathProgramCache]: Analyzing trace with hash -733853726, now seen corresponding path program 1 times [2024-09-12 17:53:08,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:08,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873006042] [2024-09-12 17:53:08,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:08,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:08,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873006042] [2024-09-12 17:53:08,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873006042] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:08,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:08,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:53:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845877135] [2024-09-12 17:53:08,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:08,735 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:53:08,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:08,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:53:08,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:53:08,736 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:08,775 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2024-09-12 17:53:08,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:53:08,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 17:53:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:08,776 INFO L225 Difference]: With dead ends: 65 [2024-09-12 17:53:08,778 INFO L226 Difference]: Without dead ends: 64 [2024-09-12 17:53:08,779 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 17:53:08,779 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:08,779 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 77 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:08,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-12 17:53:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-09-12 17:53:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 53 states have internal predecessors, (62), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2024-09-12 17:53:08,791 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 14 [2024-09-12 17:53:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:08,791 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2024-09-12 17:53:08,791 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:08,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2024-09-12 17:53:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 17:53:08,793 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:08,793 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:08,794 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 17:53:08,794 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting fooErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:08,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:08,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1322483175, now seen corresponding path program 1 times [2024-09-12 17:53:08,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:08,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376122476] [2024-09-12 17:53:08,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:08,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:08,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:08,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376122476] [2024-09-12 17:53:08,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376122476] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:08,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:08,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:53:08,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094140340] [2024-09-12 17:53:08,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:08,852 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:53:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:53:08,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:53:08,853 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:08,888 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2024-09-12 17:53:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:53:08,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 17:53:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:08,889 INFO L225 Difference]: With dead ends: 59 [2024-09-12 17:53:08,889 INFO L226 Difference]: Without dead ends: 58 [2024-09-12 17:53:08,889 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:53:08,890 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:08,890 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 163 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:08,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-12 17:53:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-12 17:53:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 52 states have internal predecessors, (61), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2024-09-12 17:53:08,895 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 15 [2024-09-12 17:53:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:08,896 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2024-09-12 17:53:08,896 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:08,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2024-09-12 17:53:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 17:53:08,897 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:08,897 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:08,897 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 17:53:08,897 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:08,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:08,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1322483367, now seen corresponding path program 1 times [2024-09-12 17:53:08,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:08,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409965629] [2024-09-12 17:53:08,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,957 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:08,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:08,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409965629] [2024-09-12 17:53:08,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409965629] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:08,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:08,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:53:08,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309593240] [2024-09-12 17:53:08,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:08,962 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:53:08,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:53:08,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:53:08,963 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:09,008 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2024-09-12 17:53:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:53:09,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 17:53:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:09,009 INFO L225 Difference]: With dead ends: 58 [2024-09-12 17:53:09,010 INFO L226 Difference]: Without dead ends: 57 [2024-09-12 17:53:09,010 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:53:09,011 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:09,012 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 193 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-12 17:53:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-12 17:53:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 51 states have internal predecessors, (60), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2024-09-12 17:53:09,019 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 15 [2024-09-12 17:53:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:09,020 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2024-09-12 17:53:09,020 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2024-09-12 17:53:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 17:53:09,021 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:09,021 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:09,021 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 17:53:09,021 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:09,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1666483417, now seen corresponding path program 1 times [2024-09-12 17:53:09,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:09,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881049845] [2024-09-12 17:53:09,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:09,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:09,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:09,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881049845] [2024-09-12 17:53:09,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881049845] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:09,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:09,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:53:09,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816955637] [2024-09-12 17:53:09,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:09,074 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:53:09,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:09,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:53:09,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:53:09,075 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:09,105 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-09-12 17:53:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:53:09,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 17:53:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:09,106 INFO L225 Difference]: With dead ends: 59 [2024-09-12 17:53:09,107 INFO L226 Difference]: Without dead ends: 58 [2024-09-12 17:53:09,107 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 17:53:09,108 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:09,108 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 105 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-12 17:53:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-09-12 17:53:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2024-09-12 17:53:09,118 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 14 [2024-09-12 17:53:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:09,122 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2024-09-12 17:53:09,122 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2024-09-12 17:53:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 17:53:09,123 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:09,123 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:09,123 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 17:53:09,123 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:09,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1274622747, now seen corresponding path program 1 times [2024-09-12 17:53:09,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:09,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494292514] [2024-09-12 17:53:09,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:09,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:09,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494292514] [2024-09-12 17:53:09,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494292514] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:09,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:09,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:53:09,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114713259] [2024-09-12 17:53:09,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:09,171 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:53:09,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:09,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:53:09,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:53:09,172 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:09,220 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2024-09-12 17:53:09,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:53:09,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 17:53:09,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:09,221 INFO L225 Difference]: With dead ends: 60 [2024-09-12 17:53:09,221 INFO L226 Difference]: Without dead ends: 58 [2024-09-12 17:53:09,222 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 17:53:09,222 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:09,223 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 171 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-12 17:53:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2024-09-12 17:53:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.375) internal successors, (55), 47 states have internal predecessors, (55), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2024-09-12 17:53:09,234 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 15 [2024-09-12 17:53:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:09,234 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2024-09-12 17:53:09,234 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2024-09-12 17:53:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 17:53:09,235 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:09,235 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:09,235 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 17:53:09,235 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting fooErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:09,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1952694590, now seen corresponding path program 1 times [2024-09-12 17:53:09,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:09,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850913744] [2024-09-12 17:53:09,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:09,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:09,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:09,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850913744] [2024-09-12 17:53:09,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850913744] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:09,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:09,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:53:09,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655617154] [2024-09-12 17:53:09,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:09,281 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:53:09,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:09,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:53:09,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:53:09,282 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:09,298 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-09-12 17:53:09,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:53:09,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 17:53:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:09,299 INFO L225 Difference]: With dead ends: 53 [2024-09-12 17:53:09,300 INFO L226 Difference]: Without dead ends: 52 [2024-09-12 17:53:09,300 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:53:09,301 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:09,301 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-12 17:53:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-09-12 17:53:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.368421052631579) internal successors, (52), 44 states have internal predecessors, (52), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-09-12 17:53:09,307 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 16 [2024-09-12 17:53:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:09,308 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-09-12 17:53:09,308 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,309 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-09-12 17:53:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 17:53:09,310 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:09,310 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:09,312 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 17:53:09,312 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting fooErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:09,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1952688632, now seen corresponding path program 1 times [2024-09-12 17:53:09,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:09,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117762026] [2024-09-12 17:53:09,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:09,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,367 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:09,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:09,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117762026] [2024-09-12 17:53:09,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117762026] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:09,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:09,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:53:09,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295045642] [2024-09-12 17:53:09,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:09,370 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:53:09,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:09,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:53:09,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:53:09,374 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:09,399 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2024-09-12 17:53:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:53:09,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 17:53:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:09,400 INFO L225 Difference]: With dead ends: 52 [2024-09-12 17:53:09,401 INFO L226 Difference]: Without dead ends: 51 [2024-09-12 17:53:09,401 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:53:09,401 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:09,402 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 170 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-12 17:53:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-09-12 17:53:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 40 states have internal predecessors, (47), 7 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2024-09-12 17:53:09,407 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 16 [2024-09-12 17:53:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:09,408 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2024-09-12 17:53:09,408 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2024-09-12 17:53:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 17:53:09,409 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:09,409 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:09,409 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 17:53:09,409 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:09,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,410 INFO L85 PathProgramCache]: Analyzing trace with hash 531204627, now seen corresponding path program 1 times [2024-09-12 17:53:09,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:09,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608906557] [2024-09-12 17:53:09,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:09,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:09,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:09,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608906557] [2024-09-12 17:53:09,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608906557] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:09,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:09,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:53:09,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701732387] [2024-09-12 17:53:09,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:09,460 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:53:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:09,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:53:09,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:53:09,461 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:09,480 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-09-12 17:53:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:53:09,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 17:53:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:09,481 INFO L225 Difference]: With dead ends: 46 [2024-09-12 17:53:09,481 INFO L226 Difference]: Without dead ends: 38 [2024-09-12 17:53:09,481 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 17:53:09,482 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:09,482 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 152 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-12 17:53:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-12 17:53:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 33 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2024-09-12 17:53:09,486 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 16 [2024-09-12 17:53:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:09,486 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2024-09-12 17:53:09,486 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2024-09-12 17:53:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 17:53:09,487 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:09,487 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:09,487 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 17:53:09,487 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:09,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,488 INFO L85 PathProgramCache]: Analyzing trace with hash -858599381, now seen corresponding path program 1 times [2024-09-12 17:53:09,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:09,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607891397] [2024-09-12 17:53:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:09,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:09,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:09,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607891397] [2024-09-12 17:53:09,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607891397] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:09,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:09,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:53:09,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654329496] [2024-09-12 17:53:09,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:09,520 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:53:09,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:09,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:53:09,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:53:09,521 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:09,543 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-09-12 17:53:09,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:53:09,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 17:53:09,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:09,544 INFO L225 Difference]: With dead ends: 44 [2024-09-12 17:53:09,544 INFO L226 Difference]: Without dead ends: 43 [2024-09-12 17:53:09,544 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:53:09,545 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:09,545 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 73 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-12 17:53:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-12 17:53:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 38 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2024-09-12 17:53:09,550 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 16 [2024-09-12 17:53:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:09,550 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2024-09-12 17:53:09,550 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2024-09-12 17:53:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 17:53:09,551 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:09,551 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:09,551 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-12 17:53:09,551 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:09,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash -664452593, now seen corresponding path program 1 times [2024-09-12 17:53:09,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:09,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309855900] [2024-09-12 17:53:09,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:09,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:09,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:09,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309855900] [2024-09-12 17:53:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309855900] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:09,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:53:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:53:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388907702] [2024-09-12 17:53:09,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:09,591 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:53:09,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:09,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:53:09,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:53:09,592 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:09,630 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2024-09-12 17:53:09,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:53:09,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-12 17:53:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:09,631 INFO L225 Difference]: With dead ends: 47 [2024-09-12 17:53:09,631 INFO L226 Difference]: Without dead ends: 46 [2024-09-12 17:53:09,632 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:53:09,632 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:09,632 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 97 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-12 17:53:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2024-09-12 17:53:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:53:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2024-09-12 17:53:09,638 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 18 [2024-09-12 17:53:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:09,638 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-09-12 17:53:09,638 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2024-09-12 17:53:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 17:53:09,639 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:09,639 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:09,639 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 17:53:09,639 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:09,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2003804381, now seen corresponding path program 1 times [2024-09-12 17:53:09,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:09,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683980748] [2024-09-12 17:53:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:09,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:09,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683980748] [2024-09-12 17:53:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683980748] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:53:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514733140] [2024-09-12 17:53:09,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:09,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:53:09,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:53:09,705 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 17:53:09,707 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 17:53:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:09,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 17:53:09,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:53:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:09,833 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 17:53:09,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514733140] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:53:09,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 17:53:09,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-09-12 17:53:09,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762953193] [2024-09-12 17:53:09,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:53:09,834 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:53:09,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:09,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:53:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-12 17:53:09,835 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:09,871 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-09-12 17:53:09,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:53:09,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-12 17:53:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:09,872 INFO L225 Difference]: With dead ends: 50 [2024-09-12 17:53:09,872 INFO L226 Difference]: Without dead ends: 35 [2024-09-12 17:53:09,872 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-12 17:53:09,872 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:09,873 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 105 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-12 17:53:09,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-12 17:53:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:53:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-09-12 17:53:09,876 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2024-09-12 17:53:09,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:09,876 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-09-12 17:53:09,877 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:09,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-09-12 17:53:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 17:53:09,877 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:09,877 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:09,893 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 17:53:10,081 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-12 17:53:10,082 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:10,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash 797176511, now seen corresponding path program 1 times [2024-09-12 17:53:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:10,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260515890] [2024-09-12 17:53:10,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:10,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:10,132 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:10,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:10,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260515890] [2024-09-12 17:53:10,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260515890] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:53:10,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948992019] [2024-09-12 17:53:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:10,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:53:10,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:53:10,138 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 17:53:10,142 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 17:53:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:10,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 17:53:10,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:53:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:10,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:53:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:10,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948992019] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:53:10,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:53:10,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-09-12 17:53:10,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290171420] [2024-09-12 17:53:10,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:53:10,323 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 17:53:10,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:10,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 17:53:10,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-09-12 17:53:10,323 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:10,413 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2024-09-12 17:53:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 17:53:10,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-12 17:53:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:10,414 INFO L225 Difference]: With dead ends: 45 [2024-09-12 17:53:10,414 INFO L226 Difference]: Without dead ends: 44 [2024-09-12 17:53:10,415 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2024-09-12 17:53:10,415 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 27 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:10,415 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 142 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:53:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-12 17:53:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-09-12 17:53:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:53:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-09-12 17:53:10,420 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 21 [2024-09-12 17:53:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:10,421 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-09-12 17:53:10,421 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:10,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-09-12 17:53:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-12 17:53:10,421 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:10,421 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:10,436 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 17:53:10,622 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-12 17:53:10,623 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:10,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:10,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1451214351, now seen corresponding path program 2 times [2024-09-12 17:53:10,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:10,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224361946] [2024-09-12 17:53:10,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:10,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:10,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:10,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:10,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224361946] [2024-09-12 17:53:10,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224361946] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:53:10,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913925157] [2024-09-12 17:53:10,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:53:10,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:53:10,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:53:10,739 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 17:53:10,740 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 17:53:10,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 17:53:10,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:53:10,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 17:53:10,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:53:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:10,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:53:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:11,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913925157] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:53:11,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:53:11,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-09-12 17:53:11,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968758536] [2024-09-12 17:53:11,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:53:11,172 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-12 17:53:11,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:11,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-12 17:53:11,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2024-09-12 17:53:11,173 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 26 states, 25 states have (on average 3.16) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:11,449 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2024-09-12 17:53:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 17:53:11,450 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.16) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-09-12 17:53:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:11,450 INFO L225 Difference]: With dead ends: 63 [2024-09-12 17:53:11,450 INFO L226 Difference]: Without dead ends: 62 [2024-09-12 17:53:11,451 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=395, Invalid=937, Unknown=0, NotChecked=0, Total=1332 [2024-09-12 17:53:11,451 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 57 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:11,451 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 287 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:53:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-12 17:53:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-09-12 17:53:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 57 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:53:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-09-12 17:53:11,459 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 30 [2024-09-12 17:53:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:11,459 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-09-12 17:53:11,459 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.16) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:11,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-09-12 17:53:11,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-12 17:53:11,460 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:11,460 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:11,478 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 17:53:11,664 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-12 17:53:11,665 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:11,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:11,665 INFO L85 PathProgramCache]: Analyzing trace with hash -350204913, now seen corresponding path program 3 times [2024-09-12 17:53:11,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:11,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123643061] [2024-09-12 17:53:11,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:11,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:11,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:11,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123643061] [2024-09-12 17:53:11,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123643061] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:53:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359306483] [2024-09-12 17:53:11,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 17:53:11,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:53:11,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:53:11,887 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 17:53:11,895 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 17:53:11,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-09-12 17:53:11,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:53:11,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-12 17:53:11,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:53:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:12,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:53:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359306483] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:53:12,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:53:12,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2024-09-12 17:53:12,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284342584] [2024-09-12 17:53:12,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:53:12,537 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-09-12 17:53:12,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:12,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-09-12 17:53:12,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=1477, Unknown=0, NotChecked=0, Total=1892 [2024-09-12 17:53:12,538 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 44 states, 43 states have (on average 3.0930232558139537) internal successors, (133), 44 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:13,287 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2024-09-12 17:53:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-12 17:53:13,287 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 3.0930232558139537) internal successors, (133), 44 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-09-12 17:53:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:13,290 INFO L225 Difference]: With dead ends: 99 [2024-09-12 17:53:13,290 INFO L226 Difference]: Without dead ends: 98 [2024-09-12 17:53:13,292 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1259, Invalid=3163, Unknown=0, NotChecked=0, Total=4422 [2024-09-12 17:53:13,293 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 117 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:13,293 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 435 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:53:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-12 17:53:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-09-12 17:53:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.054945054945055) internal successors, (96), 93 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:53:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2024-09-12 17:53:13,317 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 48 [2024-09-12 17:53:13,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:13,317 INFO L474 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2024-09-12 17:53:13,317 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.0930232558139537) internal successors, (133), 44 states have internal predecessors, (133), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:13,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2024-09-12 17:53:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-09-12 17:53:13,318 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:13,318 INFO L216 NwaCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:13,332 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 17:53:13,518 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-12 17:53:13,518 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:13,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:13,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1681971215, now seen corresponding path program 4 times [2024-09-12 17:53:13,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:13,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498582568] [2024-09-12 17:53:13,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:13,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:14,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:14,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:14,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498582568] [2024-09-12 17:53:14,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498582568] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:53:14,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284342030] [2024-09-12 17:53:14,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 17:53:14,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:53:14,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:53:14,165 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 17:53:14,169 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 17:53:14,213 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 17:53:14,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:53:14,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-12 17:53:14,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:53:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:14,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:53:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:15,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284342030] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:53:15,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:53:15,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 79 [2024-09-12 17:53:15,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114713597] [2024-09-12 17:53:15,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:53:15,810 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-09-12 17:53:15,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:15,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-09-12 17:53:15,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=5095, Unknown=0, NotChecked=0, Total=6320 [2024-09-12 17:53:15,833 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 80 states, 79 states have (on average 3.050632911392405) internal successors, (241), 80 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:18,662 INFO L93 Difference]: Finished difference Result 171 states and 199 transitions. [2024-09-12 17:53:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-09-12 17:53:18,663 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 3.050632911392405) internal successors, (241), 80 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2024-09-12 17:53:18,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:18,664 INFO L225 Difference]: With dead ends: 171 [2024-09-12 17:53:18,664 INFO L226 Difference]: Without dead ends: 170 [2024-09-12 17:53:18,667 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4952 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4499, Invalid=11503, Unknown=0, NotChecked=0, Total=16002 [2024-09-12 17:53:18,667 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 259 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:18,667 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 713 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:53:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-09-12 17:53:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-09-12 17:53:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 163 states have (on average 1.030674846625767) internal successors, (168), 165 states have internal predecessors, (168), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:53:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 175 transitions. [2024-09-12 17:53:18,693 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 175 transitions. Word has length 84 [2024-09-12 17:53:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:18,693 INFO L474 AbstractCegarLoop]: Abstraction has 170 states and 175 transitions. [2024-09-12 17:53:18,693 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 3.050632911392405) internal successors, (241), 80 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:18,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 175 transitions. [2024-09-12 17:53:18,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-09-12 17:53:18,697 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:18,697 INFO L216 NwaCegarLoop]: trace histogram [47, 47, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:18,709 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 17:53:18,897 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:53:18,898 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:18,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1887432719, now seen corresponding path program 5 times [2024-09-12 17:53:18,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:18,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683747829] [2024-09-12 17:53:18,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:20,348 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 3243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:20,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683747829] [2024-09-12 17:53:20,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683747829] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:53:20,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84915223] [2024-09-12 17:53:20,356 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 17:53:20,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:53:20,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:53:20,358 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:53:20,359 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 17:53:20,432 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-09-12 17:53:20,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:53:20,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-09-12 17:53:20,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:53:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 3243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:22,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:53:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 3243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:25,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84915223] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:53:25,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:53:25,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2024-09-12 17:53:25,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146766162] [2024-09-12 17:53:25,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:53:25,081 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 152 states [2024-09-12 17:53:25,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:25,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2024-09-12 17:53:25,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4141, Invalid=18811, Unknown=0, NotChecked=0, Total=22952 [2024-09-12 17:53:25,086 INFO L87 Difference]: Start difference. First operand 170 states and 175 transitions. Second operand has 152 states, 151 states have (on average 3.0264900662251657) internal successors, (457), 152 states have internal predecessors, (457), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:39,604 INFO L93 Difference]: Finished difference Result 315 states and 367 transitions. [2024-09-12 17:53:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-09-12 17:53:39,605 INFO L78 Accepts]: Start accepts. Automaton has has 152 states, 151 states have (on average 3.0264900662251657) internal successors, (457), 152 states have internal predecessors, (457), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 156 [2024-09-12 17:53:39,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:39,606 INFO L225 Difference]: With dead ends: 315 [2024-09-12 17:53:39,606 INFO L226 Difference]: Without dead ends: 314 [2024-09-12 17:53:39,610 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19112 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=17027, Invalid=43735, Unknown=0, NotChecked=0, Total=60762 [2024-09-12 17:53:39,611 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 481 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:39,611 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1162 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 17:53:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-09-12 17:53:39,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2024-09-12 17:53:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 307 states have (on average 1.01628664495114) internal successors, (312), 309 states have internal predecessors, (312), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:53:39,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 319 transitions. [2024-09-12 17:53:39,654 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 319 transitions. Word has length 156 [2024-09-12 17:53:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:39,655 INFO L474 AbstractCegarLoop]: Abstraction has 314 states and 319 transitions. [2024-09-12 17:53:39,655 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 152 states, 151 states have (on average 3.0264900662251657) internal successors, (457), 152 states have internal predecessors, (457), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:39,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 319 transitions. [2024-09-12 17:53:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-09-12 17:53:39,657 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:39,657 INFO L216 NwaCegarLoop]: trace histogram [95, 95, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:53:39,670 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 17:53:39,861 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:53:39,862 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:53:39,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash 83238927, now seen corresponding path program 6 times [2024-09-12 17:53:39,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:39,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596231697] [2024-09-12 17:53:39,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:39,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:44,596 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 13395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:44,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596231697] [2024-09-12 17:53:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596231697] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:53:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749321613] [2024-09-12 17:53:44,604 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-12 17:53:44,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:53:44,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:53:44,606 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:53:44,606 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 17:53:44,798 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-09-12 17:53:44,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:53:44,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-09-12 17:53:44,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:53:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 13395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:50,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:54:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 13395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:54:01,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749321613] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:54:01,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:54:01,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 295 [2024-09-12 17:54:01,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476196962] [2024-09-12 17:54:01,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:54:01,111 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 296 states [2024-09-12 17:54:01,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:54:01,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 296 interpolants. [2024-09-12 17:54:01,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15157, Invalid=72163, Unknown=0, NotChecked=0, Total=87320 [2024-09-12 17:54:01,119 INFO L87 Difference]: Start difference. First operand 314 states and 319 transitions. Second operand has 296 states, 295 states have (on average 3.013559322033898) internal successors, (889), 296 states have internal predecessors, (889), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:29,100 INFO L93 Difference]: Finished difference Result 603 states and 703 transitions. [2024-09-12 17:55:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-09-12 17:55:29,101 INFO L78 Accepts]: Start accepts. Automaton has has 296 states, 295 states have (on average 3.013559322033898) internal successors, (889), 296 states have internal predecessors, (889), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 300 [2024-09-12 17:55:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:29,106 INFO L225 Difference]: With dead ends: 603 [2024-09-12 17:55:29,106 INFO L226 Difference]: Without dead ends: 602 [2024-09-12 17:55:29,117 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 891 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75080 ImplicationChecksByTransitivity, 104.3s TimeCoverageRelationStatistics Valid=66275, Invalid=170407, Unknown=0, NotChecked=0, Total=236682 [2024-09-12 17:55:29,118 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 965 mSDsluCounter, 2815 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:29,118 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 2842 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-12 17:55:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-09-12 17:55:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-09-12 17:55:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 595 states have (on average 1.0084033613445378) internal successors, (600), 597 states have internal predecessors, (600), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:55:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 607 transitions. [2024-09-12 17:55:29,218 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 607 transitions. Word has length 300 [2024-09-12 17:55:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:29,219 INFO L474 AbstractCegarLoop]: Abstraction has 602 states and 607 transitions. [2024-09-12 17:55:29,219 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 296 states, 295 states have (on average 3.013559322033898) internal successors, (889), 296 states have internal predecessors, (889), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:29,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 607 transitions. [2024-09-12 17:55:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2024-09-12 17:55:29,226 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:29,226 INFO L216 NwaCegarLoop]: trace histogram [191, 191, 190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:29,239 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 17:55:29,429 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:29,430 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fooErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2024-09-12 17:55:29,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1111326705, now seen corresponding path program 7 times [2024-09-12 17:55:29,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:29,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718934007] [2024-09-12 17:55:29,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:29,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:49,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 54435 backedges. 0 proven. 54435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:49,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:49,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718934007] [2024-09-12 17:55:49,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718934007] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:55:49,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368094449] [2024-09-12 17:55:49,713 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-12 17:55:49,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:49,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:55:49,714 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:55:49,715 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-12 17:55:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:49,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 195 conjuncts are in the unsatisfiable core [2024-09-12 17:55:49,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 54435 backedges. 0 proven. 54435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:13,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 54435 backedges. 0 proven. 54435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:52,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368094449] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:52,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:52,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [195, 195, 195] total 583 [2024-09-12 17:56:52,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339752972] [2024-09-12 17:56:52,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:52,721 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 584 states [2024-09-12 17:56:52,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:52,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 584 interpolants. [2024-09-12 17:56:52,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57925, Invalid=282547, Unknown=0, NotChecked=0, Total=340472 [2024-09-12 17:56:52,742 INFO L87 Difference]: Start difference. First operand 602 states and 607 transitions. Second operand has 584 states, 583 states have (on average 3.006861063464837) internal successors, (1753), 584 states have internal predecessors, (1753), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)