./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/EvenOdd03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/EvenOdd03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eda92234de2991558d0fa68c10405194bf8879d4d71f81bbe5c79bf2cf318fe2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:36:29,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:36:29,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:36:29,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:36:29,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:36:29,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:36:29,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:36:29,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:36:29,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:36:29,158 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:36:29,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:36:29,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:36:29,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:36:29,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:36:29,162 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:36:29,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:36:29,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:36:29,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:36:29,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:36:29,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:36:29,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:36:29,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:36:29,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:36:29,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:36:29,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:36:29,170 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:36:29,170 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:36:29,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:36:29,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:36:29,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:36:29,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:36:29,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:36:29,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:36:29,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:36:29,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:36:29,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:36:29,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:36:29,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:36:29,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:36:29,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:36:29,176 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:36:29,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:36:29,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:36:29,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:36:29,177 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/ultimate/releaseScripts/default/UAutomizer-linux/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/ultimate/releaseScripts/default/UAutomizer-linux 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 ! overflow) ) 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 -> eda92234de2991558d0fa68c10405194bf8879d4d71f81bbe5c79bf2cf318fe2 [2024-11-10 19:36:29,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:36:29,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:36:29,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:36:29,472 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:36:29,472 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:36:29,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/EvenOdd03.c [2024-11-10 19:36:31,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:36:31,180 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:36:31,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/EvenOdd03.c [2024-11-10 19:36:31,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5097824e/94678a53fd484926ae2d523094bbbc7d/FLAG37cbfaa17 [2024-11-10 19:36:31,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5097824e/94678a53fd484926ae2d523094bbbc7d [2024-11-10 19:36:31,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:36:31,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:36:31,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:36:31,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:36:31,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:36:31,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4593a6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31, skipping insertion in model container [2024-11-10 19:36:31,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:36:31,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:36:31,801 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:36:31,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:36:31,832 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:36:31,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31 WrapperNode [2024-11-10 19:36:31,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:36:31,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:36:31,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:36:31,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:36:31,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,860 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2024-11-10 19:36:31,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:36:31,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:36:31,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:36:31,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:36:31,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,882 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-11-10 19:36:31,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,886 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:36:31,890 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:36:31,890 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:36:31,891 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:36:31,891 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (1/1) ... [2024-11-10 19:36:31,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:36:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:36:31,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 19:36:31,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 19:36:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:36:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2024-11-10 19:36:31,987 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2024-11-10 19:36:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:36:31,987 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2024-11-10 19:36:31,987 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2024-11-10 19:36:31,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:36:31,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:36:32,055 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:36:32,059 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:36:32,153 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc #t~ret5; [2024-11-10 19:36:32,186 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret4; [2024-11-10 19:36:32,253 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 19:36:32,253 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:36:32,273 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:36:32,274 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:36:32,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:36:32 BoogieIcfgContainer [2024-11-10 19:36:32,275 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:36:32,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:36:32,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:36:32,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:36:32,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:36:31" (1/3) ... [2024-11-10 19:36:32,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e35b22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:36:32, skipping insertion in model container [2024-11-10 19:36:32,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:36:31" (2/3) ... [2024-11-10 19:36:32,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e35b22d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:36:32, skipping insertion in model container [2024-11-10 19:36:32,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:36:32" (3/3) ... [2024-11-10 19:36:32,290 INFO L112 eAbstractionObserver]: Analyzing ICFG EvenOdd03.c [2024-11-10 19:36:32,308 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:36:32,309 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 19:36:32,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:36:32,390 INFO L333 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=LoopHeads, 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;@722d15ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:36:32,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 19:36:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:36:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 19:36:32,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:36:32,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:36:32,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:36:32,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:36:32,411 INFO L85 PathProgramCache]: Analyzing trace with hash -455651386, now seen corresponding path program 1 times [2024-11-10 19:36:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:36:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281186047] [2024-11-10 19:36:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:36:32,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:36:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:36:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:32,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:36:32,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281186047] [2024-11-10 19:36:32,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281186047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:36:32,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:36:32,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:36:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758538242] [2024-11-10 19:36:32,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:36:32,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:36:32,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:36:32,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:36:32,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:36:32,689 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:36:32,830 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2024-11-10 19:36:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:36:32,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 19:36:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:36:32,842 INFO L225 Difference]: With dead ends: 49 [2024-11-10 19:36:32,843 INFO L226 Difference]: Without dead ends: 27 [2024-11-10 19:36:32,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:36:32,850 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:36:32,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 110 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:36:32,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-10 19:36:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-11-10 19:36:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-11-10 19:36:32,889 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 8 [2024-11-10 19:36:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:36:32,891 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-11-10 19:36:32,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-11-10 19:36:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 19:36:32,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:36:32,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:36:32,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:36:32,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:36:32,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:36:32,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1240291103, now seen corresponding path program 1 times [2024-11-10 19:36:32,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:36:32,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648128549] [2024-11-10 19:36:32,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:36:32,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:36:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:36:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:32,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:36:32,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648128549] [2024-11-10 19:36:32,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648128549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:36:32,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:36:32,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:36:32,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150995183] [2024-11-10 19:36:32,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:36:32,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:36:32,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:36:32,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:36:32,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:36:32,999 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:36:33,083 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-11-10 19:36:33,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:36:33,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 19:36:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:36:33,086 INFO L225 Difference]: With dead ends: 27 [2024-11-10 19:36:33,086 INFO L226 Difference]: Without dead ends: 26 [2024-11-10 19:36:33,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-10 19:36:33,088 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:36:33,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 55 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:36:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-10 19:36:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-10 19:36:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-10 19:36:33,097 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 9 [2024-11-10 19:36:33,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:36:33,098 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-11-10 19:36:33,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-10 19:36:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 19:36:33,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:36:33,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:36:33,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:36:33,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:36:33,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:36:33,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1943195974, now seen corresponding path program 1 times [2024-11-10 19:36:33,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:36:33,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406480101] [2024-11-10 19:36:33,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:36:33,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:36:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:36:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:33,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:36:33,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406480101] [2024-11-10 19:36:33,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406480101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:36:33,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:36:33,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:36:33,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127191598] [2024-11-10 19:36:33,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:36:33,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:36:33,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:36:33,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:36:33,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:36:33,246 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:36:33,350 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2024-11-10 19:36:33,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:36:33,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-10 19:36:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:36:33,352 INFO L225 Difference]: With dead ends: 34 [2024-11-10 19:36:33,352 INFO L226 Difference]: Without dead ends: 33 [2024-11-10 19:36:33,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:36:33,354 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:36:33,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 55 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:36:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-10 19:36:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2024-11-10 19:36:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 25 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-11-10 19:36:33,360 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 14 [2024-11-10 19:36:33,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:36:33,361 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-11-10 19:36:33,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-11-10 19:36:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 19:36:33,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:36:33,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:36:33,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 19:36:33,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:36:33,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:36:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash 109533038, now seen corresponding path program 1 times [2024-11-10 19:36:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:36:33,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041502425] [2024-11-10 19:36:33,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:36:33,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:36:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:36:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:33,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:36:33,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041502425] [2024-11-10 19:36:33,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041502425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:36:33,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:36:33,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:36:33,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505658844] [2024-11-10 19:36:33,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:36:33,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:36:33,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:36:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:36:33,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:36:33,487 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:36:33,562 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2024-11-10 19:36:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:36:33,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 19:36:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:36:33,563 INFO L225 Difference]: With dead ends: 30 [2024-11-10 19:36:33,564 INFO L226 Difference]: Without dead ends: 28 [2024-11-10 19:36:33,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:36:33,566 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:36:33,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 26 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:36:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-10 19:36:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-10 19:36:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-11-10 19:36:33,580 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2024-11-10 19:36:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:36:33,580 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2024-11-10 19:36:33,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-11-10 19:36:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 19:36:33,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:36:33,582 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:36:33,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 19:36:33,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:36:33,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:36:33,585 INFO L85 PathProgramCache]: Analyzing trace with hash 667698843, now seen corresponding path program 1 times [2024-11-10 19:36:33,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:36:33,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116312166] [2024-11-10 19:36:33,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:36:33,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:36:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:36:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:33,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:36:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116312166] [2024-11-10 19:36:33,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116312166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:36:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378846473] [2024-11-10 19:36:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:36:33,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:36:33,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:36:33,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:36:33,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 19:36:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:36:33,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 19:36:33,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:36:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:33,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:36:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:33,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378846473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:36:33,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:36:33,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-10 19:36:33,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688338495] [2024-11-10 19:36:33,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:36:33,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 19:36:33,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:36:33,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 19:36:33,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-10 19:36:33,998 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:36:34,147 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2024-11-10 19:36:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 19:36:34,148 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-10 19:36:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:36:34,149 INFO L225 Difference]: With dead ends: 50 [2024-11-10 19:36:34,149 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 19:36:34,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-11-10 19:36:34,151 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:36:34,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 68 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:36:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 19:36:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-11-10 19:36:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2024-11-10 19:36:34,158 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 20 [2024-11-10 19:36:34,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:36:34,158 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2024-11-10 19:36:34,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2024-11-10 19:36:34,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 19:36:34,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:36:34,159 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 19:36:34,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 19:36:34,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:36:34,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:36:34,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:36:34,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1225957392, now seen corresponding path program 1 times [2024-11-10 19:36:34,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:36:34,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368965035] [2024-11-10 19:36:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:36:34,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:36:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:36:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:34,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:36:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368965035] [2024-11-10 19:36:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368965035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:36:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951306862] [2024-11-10 19:36:34,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:36:34,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:36:34,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:36:34,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:36:34,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 19:36:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:36:34,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 19:36:34,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:36:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:34,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:36:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:35,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951306862] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:36:35,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:36:35,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2024-11-10 19:36:35,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252047970] [2024-11-10 19:36:35,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:36:35,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 19:36:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:36:35,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 19:36:35,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2024-11-10 19:36:35,079 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 28 states, 25 states have (on average 2.48) internal successors, (62), 16 states have internal predecessors, (62), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:36:35,430 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-10 19:36:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 19:36:35,431 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.48) internal successors, (62), 16 states have internal predecessors, (62), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-10 19:36:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:36:35,432 INFO L225 Difference]: With dead ends: 92 [2024-11-10 19:36:35,432 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 19:36:35,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2024-11-10 19:36:35,434 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 115 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:36:35,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 68 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:36:35,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 19:36:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-11-10 19:36:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 73 states have internal predecessors, (74), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2024-11-10 19:36:35,445 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 38 [2024-11-10 19:36:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:36:35,446 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2024-11-10 19:36:35,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.48) internal successors, (62), 16 states have internal predecessors, (62), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2024-11-10 19:36:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 19:36:35,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:36:35,448 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2024-11-10 19:36:35,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 19:36:35,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 19:36:35,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:36:35,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:36:35,654 INFO L85 PathProgramCache]: Analyzing trace with hash -914802620, now seen corresponding path program 2 times [2024-11-10 19:36:35,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:36:35,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216791255] [2024-11-10 19:36:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:36:35,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:36:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:36:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:36,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:36:36,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216791255] [2024-11-10 19:36:36,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216791255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:36:36,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123167413] [2024-11-10 19:36:36,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:36:36,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:36:36,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:36:36,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:36:36,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 19:36:36,308 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:36:36,308 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:36:36,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 19:36:36,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:36:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:36,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:36:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:37,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123167413] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:36:37,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:36:37,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2024-11-10 19:36:37,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054980603] [2024-11-10 19:36:37,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:36:37,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-10 19:36:37,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:36:37,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-10 19:36:37,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2656, Unknown=0, NotChecked=0, Total=3080 [2024-11-10 19:36:37,181 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand has 56 states, 53 states have (on average 2.490566037735849) internal successors, (132), 30 states have internal predecessors, (132), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:36:38,052 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2024-11-10 19:36:38,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-10 19:36:38,053 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 2.490566037735849) internal successors, (132), 30 states have internal predecessors, (132), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-10 19:36:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:36:38,054 INFO L225 Difference]: With dead ends: 170 [2024-11-10 19:36:38,054 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 19:36:38,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=970, Invalid=5510, Unknown=0, NotChecked=0, Total=6480 [2024-11-10 19:36:38,058 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 380 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:36:38,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 104 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 19:36:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 19:36:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2024-11-10 19:36:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.0145985401459854) internal successors, (139), 138 states have internal predecessors, (139), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2024-11-10 19:36:38,078 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 80 [2024-11-10 19:36:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:36:38,079 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2024-11-10 19:36:38,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 2.490566037735849) internal successors, (132), 30 states have internal predecessors, (132), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2024-11-10 19:36:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 19:36:38,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:36:38,086 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2024-11-10 19:36:38,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 19:36:38,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:36:38,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:36:38,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:36:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash 214116162, now seen corresponding path program 2 times [2024-11-10 19:36:38,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:36:38,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79513687] [2024-11-10 19:36:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:36:38,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:36:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:36:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:40,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:36:40,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79513687] [2024-11-10 19:36:40,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79513687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:36:40,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433343927] [2024-11-10 19:36:40,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:36:40,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:36:40,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:36:40,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:36:40,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 19:36:40,385 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:36:40,385 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:36:40,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-10 19:36:40,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:36:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:40,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:36:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:42,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433343927] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:36:42,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:36:42,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2024-11-10 19:36:42,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939600319] [2024-11-10 19:36:42,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:36:42,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2024-11-10 19:36:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:36:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2024-11-10 19:36:42,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=10042, Unknown=0, NotChecked=0, Total=11556 [2024-11-10 19:36:42,779 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand has 108 states, 105 states have (on average 2.4952380952380953) internal successors, (262), 56 states have internal predecessors, (262), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:36:44,978 INFO L93 Difference]: Finished difference Result 332 states and 357 transitions. [2024-11-10 19:36:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-11-10 19:36:44,979 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 105 states have (on average 2.4952380952380953) internal successors, (262), 56 states have internal predecessors, (262), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2024-11-10 19:36:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:36:44,981 INFO L225 Difference]: With dead ends: 332 [2024-11-10 19:36:44,983 INFO L226 Difference]: Without dead ends: 330 [2024-11-10 19:36:44,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7600 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3672, Invalid=21768, Unknown=0, NotChecked=0, Total=25440 [2024-11-10 19:36:44,989 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 945 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:36:44,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 156 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:36:44,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-10 19:36:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2024-11-10 19:36:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 272 states have (on average 1.0073529411764706) internal successors, (274), 273 states have internal predecessors, (274), 54 states have call successors, (54), 54 states have call predecessors, (54), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2024-11-10 19:36:45,022 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 158 [2024-11-10 19:36:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:36:45,023 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2024-11-10 19:36:45,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 105 states have (on average 2.4952380952380953) internal successors, (262), 56 states have internal predecessors, (262), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:36:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2024-11-10 19:36:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-11-10 19:36:45,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:36:45,029 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1] [2024-11-10 19:36:45,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 19:36:45,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:36:45,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:36:45,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:36:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash 699272168, now seen corresponding path program 3 times [2024-11-10 19:36:45,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:36:45,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138678739] [2024-11-10 19:36:45,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:36:45,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:36:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:36:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 0 proven. 4004 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:50,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:36:50,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138678739] [2024-11-10 19:36:50,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138678739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:36:50,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888615668] [2024-11-10 19:36:50,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 19:36:50,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:36:50,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:36:50,317 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:36:50,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 19:36:50,453 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2024-11-10 19:36:50,453 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:36:50,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-10 19:36:50,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:36:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 0 proven. 4004 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:50,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:36:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 0 proven. 4004 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:36:57,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888615668] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:36:57,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:36:57,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2024-11-10 19:36:57,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873204440] [2024-11-10 19:36:57,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:36:57,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 216 states [2024-11-10 19:36:57,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:36:57,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2024-11-10 19:36:57,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5944, Invalid=40496, Unknown=0, NotChecked=0, Total=46440 [2024-11-10 19:36:57,442 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand has 216 states, 213 states have (on average 2.4976525821596245) internal successors, (532), 110 states have internal predecessors, (532), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:37:03,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:37:03,830 INFO L93 Difference]: Finished difference Result 650 states and 701 transitions. [2024-11-10 19:37:03,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2024-11-10 19:37:03,831 INFO L78 Accepts]: Start accepts. Automaton has has 216 states, 213 states have (on average 2.4976525821596245) internal successors, (532), 110 states have internal predecessors, (532), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2024-11-10 19:37:03,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:37:03,834 INFO L225 Difference]: With dead ends: 650 [2024-11-10 19:37:03,834 INFO L226 Difference]: Without dead ends: 648 [2024-11-10 19:37:03,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32497 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=14530, Invalid=88190, Unknown=0, NotChecked=0, Total=102720 [2024-11-10 19:37:03,843 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 1820 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1820 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 19:37:03,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1820 Valid, 134 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 19:37:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-10 19:37:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 646. [2024-11-10 19:37:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 537 states have (on average 1.0037243947858474) internal successors, (539), 538 states have internal predecessors, (539), 107 states have call successors, (107), 107 states have call predecessors, (107), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:37:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 646 transitions. [2024-11-10 19:37:03,893 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 646 transitions. Word has length 320 [2024-11-10 19:37:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:37:03,894 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 646 transitions. [2024-11-10 19:37:03,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 216 states, 213 states have (on average 2.4976525821596245) internal successors, (532), 110 states have internal predecessors, (532), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:37:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 646 transitions. [2024-11-10 19:37:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2024-11-10 19:37:03,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:37:03,906 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 1, 1, 1, 1, 1] [2024-11-10 19:37:03,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 19:37:04,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:37:04,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-10 19:37:04,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:37:04,108 INFO L85 PathProgramCache]: Analyzing trace with hash -923961206, now seen corresponding path program 3 times [2024-11-10 19:37:04,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:37:04,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919051302] [2024-11-10 19:37:04,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:37:04,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:37:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:37:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 16432 backedges. 0 proven. 16432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:37:23,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:37:23,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919051302] [2024-11-10 19:37:23,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919051302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:37:23,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957687147] [2024-11-10 19:37:23,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 19:37:23,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:37:23,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:37:23,621 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:37:23,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 19:37:23,905 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2024-11-10 19:37:23,905 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:37:23,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 214 conjuncts are in the unsatisfiable core [2024-11-10 19:37:23,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:37:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 16432 backedges. 0 proven. 16432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:37:24,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:37:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16432 backedges. 0 proven. 16432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:37:48,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957687147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:37:48,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:37:48,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [214, 214, 214] total 427 [2024-11-10 19:37:48,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640923220] [2024-11-10 19:37:48,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:37:48,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 428 states [2024-11-10 19:37:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:37:48,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 428 interpolants. [2024-11-10 19:37:48,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23114, Invalid=159642, Unknown=0, NotChecked=0, Total=182756 [2024-11-10 19:37:48,551 INFO L87 Difference]: Start difference. First operand 646 states and 646 transitions. Second operand has 428 states, 425 states have (on average 2.498823529411765) internal successors, (1062), 216 states have internal predecessors, (1062), 212 states have call successors, (212), 212 states have call predecessors, (212), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)