./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_3_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/combinations/gcd_4+newton_3_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad6236f3b1535aee53ef497474ba76faac9143455d497d8d917066c0b5859668 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:52:28,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:52:28,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:52:28,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:52:28,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:52:29,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:52:29,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:52:29,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:52:29,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:52:29,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:52:29,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:52:29,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:52:29,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:52:29,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:52:29,046 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:52:29,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:52:29,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:52:29,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:52:29,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:52:29,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:52:29,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:52:29,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:52:29,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:52:29,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:52:29,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:52:29,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:52:29,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:52:29,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:52:29,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:52:29,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:52:29,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:52:29,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:52:29,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:52:29,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:52:29,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:52:29,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:52:29,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:52:29,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:52:29,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:52:29,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:52:29,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:52:29,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:52:29,058 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad6236f3b1535aee53ef497474ba76faac9143455d497d8d917066c0b5859668 [2024-11-08 16:52:29,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:52:29,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:52:29,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:52:29,358 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:52:29,358 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:52:29,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_1.i [2024-11-08 16:52:30,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:52:31,015 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:52:31,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i [2024-11-08 16:52:31,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a91b437/3ab599dd77da4df884e48a56449fc2f7/FLAGb9ff3c639 [2024-11-08 16:52:31,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a91b437/3ab599dd77da4df884e48a56449fc2f7 [2024-11-08 16:52:31,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:52:31,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:52:31,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:52:31,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:52:31,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:52:31,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae6d1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31, skipping insertion in model container [2024-11-08 16:52:31,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:52:31,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[1224,1237] [2024-11-08 16:52:31,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[2848,2861] [2024-11-08 16:52:31,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:52:31,288 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:52:31,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[1224,1237] [2024-11-08 16:52:31,308 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[2848,2861] [2024-11-08 16:52:31,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:52:31,326 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:52:31,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31 WrapperNode [2024-11-08 16:52:31,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:52:31,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:52:31,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:52:31,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:52:31,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,370 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 84 [2024-11-08 16:52:31,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:52:31,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:52:31,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:52:31,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:52:31,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,409 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-08 16:52:31,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:52:31,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:52:31,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:52:31,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:52:31,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:52:31,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:52:31,477 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-08 16:52:31,483 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-08 16:52:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:52:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-08 16:52:31,530 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-08 16:52:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-08 16:52:31,532 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-08 16:52:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:52:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:52:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:52:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:52:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 16:52:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 16:52:31,614 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:52:31,617 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:52:31,862 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-08 16:52:31,863 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:52:31,882 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:52:31,883 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:52:31,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:31 BoogieIcfgContainer [2024-11-08 16:52:31,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:52:31,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:52:31,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:52:31,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:52:31,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:52:31" (1/3) ... [2024-11-08 16:52:31,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d444df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:52:31, skipping insertion in model container [2024-11-08 16:52:31,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (2/3) ... [2024-11-08 16:52:31,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d444df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:52:31, skipping insertion in model container [2024-11-08 16:52:31,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:31" (3/3) ... [2024-11-08 16:52:31,894 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_1.i [2024-11-08 16:52:31,915 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:52:31,915 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 16:52:31,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:52:31,996 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;@336ee750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:52:31,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 16:52:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 16:52:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:52:32,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:32,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:32,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:32,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1780387208, now seen corresponding path program 1 times [2024-11-08 16:52:32,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:32,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665437159] [2024-11-08 16:52:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:32,350 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-08 16:52:32,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:32,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665437159] [2024-11-08 16:52:32,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665437159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:32,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:32,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023923460] [2024-11-08 16:52:32,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:32,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:32,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:32,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:32,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:32,377 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 16:52:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:32,431 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2024-11-08 16:52:32,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:52:32,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-11-08 16:52:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:32,440 INFO L225 Difference]: With dead ends: 90 [2024-11-08 16:52:32,440 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 16:52:32,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:32,446 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:32,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 95 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:52:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 16:52:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-08 16:52:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 16:52:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-08 16:52:32,481 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 11 [2024-11-08 16:52:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:32,481 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-08 16:52:32,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 16:52:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-11-08 16:52:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 16:52:32,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:32,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:32,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:52:32,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:32,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:32,485 INFO L85 PathProgramCache]: Analyzing trace with hash 413718792, now seen corresponding path program 1 times [2024-11-08 16:52:32,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:32,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573727390] [2024-11-08 16:52:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:32,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:32,573 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-08 16:52:32,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:32,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573727390] [2024-11-08 16:52:32,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573727390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:32,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:32,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110572465] [2024-11-08 16:52:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:32,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:32,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:32,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:32,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:32,579 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 16:52:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:32,603 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-11-08 16:52:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:52:32,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-11-08 16:52:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:32,607 INFO L225 Difference]: With dead ends: 55 [2024-11-08 16:52:32,607 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 16:52:32,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:32,609 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:32,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:52:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 16:52:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-08 16:52:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 16:52:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-08 16:52:32,619 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 13 [2024-11-08 16:52:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:32,620 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-08 16:52:32,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 16:52:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-08 16:52:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 16:52:32,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:32,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:32,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:52:32,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:32,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1714945339, now seen corresponding path program 1 times [2024-11-08 16:52:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:32,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136656221] [2024-11-08 16:52:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:32,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136656221] [2024-11-08 16:52:32,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136656221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:32,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:32,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:32,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481107406] [2024-11-08 16:52:32,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:32,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:32,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:32,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:32,824 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-08 16:52:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:32,846 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-11-08 16:52:32,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:52:32,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2024-11-08 16:52:32,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:32,847 INFO L225 Difference]: With dead ends: 56 [2024-11-08 16:52:32,847 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 16:52:32,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:32,852 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:32,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:52:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 16:52:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-08 16:52:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 16:52:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-08 16:52:32,866 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 15 [2024-11-08 16:52:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:32,866 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-08 16:52:32,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-08 16:52:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-08 16:52:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 16:52:32,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:32,869 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:32,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:52:32,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:32,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:32,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1030187394, now seen corresponding path program 1 times [2024-11-08 16:52:32,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:32,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683512457] [2024-11-08 16:52:32,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:32,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:33,052 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-08 16:52:33,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:33,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683512457] [2024-11-08 16:52:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683512457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:52:33,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853517728] [2024-11-08 16:52:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:33,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:33,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:52:33,057 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-08 16:52:33,060 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-08 16:52:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:33,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:52:33,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:33,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:33,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853517728] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:52:33,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:52:33,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-08 16:52:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610545653] [2024-11-08 16:52:33,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:33,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:52:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:33,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:52:33,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:52:33,348 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-08 16:52:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:33,420 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-11-08 16:52:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:52:33,421 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 17 [2024-11-08 16:52:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:33,422 INFO L225 Difference]: With dead ends: 60 [2024-11-08 16:52:33,422 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 16:52:33,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:52:33,423 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:33,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:52:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 16:52:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-08 16:52:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 16:52:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-08 16:52:33,430 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 17 [2024-11-08 16:52:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-08 16:52:33,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-08 16:52:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-08 16:52:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 16:52:33,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:33,435 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:33,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 16:52:33,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:33,636 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:33,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:33,637 INFO L85 PathProgramCache]: Analyzing trace with hash -626272964, now seen corresponding path program 2 times [2024-11-08 16:52:33,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:33,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429492019] [2024-11-08 16:52:33,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:33,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:33,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429492019] [2024-11-08 16:52:33,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429492019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:52:33,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328182170] [2024-11-08 16:52:33,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 16:52:33,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:33,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:52:33,801 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-08 16:52:33,803 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-08 16:52:33,863 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 16:52:33,864 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:52:33,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 16:52:33,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:33,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328182170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:52:34,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:52:34,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-08 16:52:34,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310177442] [2024-11-08 16:52:34,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:34,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 16:52:34,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:34,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 16:52:34,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:52:34,072 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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-08 16:52:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:34,210 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-11-08 16:52:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:52:34,211 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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 21 [2024-11-08 16:52:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:34,212 INFO L225 Difference]: With dead ends: 68 [2024-11-08 16:52:34,212 INFO L226 Difference]: Without dead ends: 53 [2024-11-08 16:52:34,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:52:34,214 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:34,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 330 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:52:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-08 16:52:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-08 16:52:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 16:52:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-11-08 16:52:34,222 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 21 [2024-11-08 16:52:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:34,223 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-11-08 16:52:34,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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-08 16:52:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-11-08 16:52:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 16:52:34,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:34,226 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:34,243 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-08 16:52:34,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:34,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:34,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1120707465, now seen corresponding path program 3 times [2024-11-08 16:52:34,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:34,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103286672] [2024-11-08 16:52:34,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:52:34,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2014992412] [2024-11-08 16:52:34,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 16:52:34,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:34,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:52:34,447 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-08 16:52:34,448 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-08 16:52:34,499 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-08 16:52:34,499 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:52:34,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 16:52:34,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 16:52:34,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 16:52:35,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:35,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103286672] [2024-11-08 16:52:35,052 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 16:52:35,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014992412] [2024-11-08 16:52:35,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014992412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:52:35,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:52:35,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-08 16:52:35,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751608966] [2024-11-08 16:52:35,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:35,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 16:52:35,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:35,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 16:52:35,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:52:35,054 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 18 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 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-08 16:52:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:35,399 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2024-11-08 16:52:35,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 16:52:35,400 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 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 23 [2024-11-08 16:52:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:35,401 INFO L225 Difference]: With dead ends: 76 [2024-11-08 16:52:35,401 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 16:52:35,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2024-11-08 16:52:35,403 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:35,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 293 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:52:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 16:52:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-11-08 16:52:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 16:52:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2024-11-08 16:52:35,414 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 23 [2024-11-08 16:52:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:35,414 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2024-11-08 16:52:35,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 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-08 16:52:35,415 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2024-11-08 16:52:35,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 16:52:35,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:35,416 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:35,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 16:52:35,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:35,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:35,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:35,622 INFO L85 PathProgramCache]: Analyzing trace with hash 469106930, now seen corresponding path program 4 times [2024-11-08 16:52:35,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:35,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747483776] [2024-11-08 16:52:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:35,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:35,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747483776] [2024-11-08 16:52:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747483776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:52:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89266587] [2024-11-08 16:52:35,776 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 16:52:35,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:52:35,778 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-08 16:52:35,779 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-08 16:52:35,839 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 16:52:35,840 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:52:35,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 16:52:35,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:35,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:36,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89266587] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:52:36,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:52:36,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-08 16:52:36,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779950278] [2024-11-08 16:52:36,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:36,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 16:52:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:36,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 16:52:36,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2024-11-08 16:52:36,157 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 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-08 16:52:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:36,333 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2024-11-08 16:52:36,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:52:36,334 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 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 25 [2024-11-08 16:52:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:36,336 INFO L225 Difference]: With dead ends: 94 [2024-11-08 16:52:36,337 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 16:52:36,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2024-11-08 16:52:36,340 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:36,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 509 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:52:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 16:52:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-08 16:52:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 16:52:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-11-08 16:52:36,358 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 25 [2024-11-08 16:52:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:36,359 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-11-08 16:52:36,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 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-08 16:52:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-11-08 16:52:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 16:52:36,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:36,363 INFO L215 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:36,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 16:52:36,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:36,564 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:36,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:36,565 INFO L85 PathProgramCache]: Analyzing trace with hash -985782289, now seen corresponding path program 5 times [2024-11-08 16:52:36,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:36,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238729916] [2024-11-08 16:52:36,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:36,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 31 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 16:52:36,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:36,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238729916] [2024-11-08 16:52:36,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238729916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:52:36,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021057799] [2024-11-08 16:52:36,721 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 16:52:36,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:36,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:52:36,724 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-08 16:52:36,726 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-08 16:52:36,774 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-08 16:52:36,775 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:52:36,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 16:52:36,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:36,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:37,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021057799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:52:37,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:52:37,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2024-11-08 16:52:37,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122562069] [2024-11-08 16:52:37,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:37,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 16:52:37,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:37,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 16:52:37,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2024-11-08 16:52:37,075 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 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-08 16:52:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:37,168 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2024-11-08 16:52:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:52:37,169 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 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 27 [2024-11-08 16:52:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:37,169 INFO L225 Difference]: With dead ends: 76 [2024-11-08 16:52:37,169 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 16:52:37,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2024-11-08 16:52:37,171 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:37,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 414 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:52:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 16:52:37,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-08 16:52:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 16:52:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-08 16:52:37,176 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 27 [2024-11-08 16:52:37,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:37,176 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-08 16:52:37,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 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-08 16:52:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-08 16:52:37,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 16:52:37,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:37,177 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:37,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 16:52:37,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:37,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:37,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:37,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1781630816, now seen corresponding path program 1 times [2024-11-08 16:52:37,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:37,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96509841] [2024-11-08 16:52:37,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:37,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:52:37,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802884594] [2024-11-08 16:52:37,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:37,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:37,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:52:37,395 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-08 16:52:37,396 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-08 16:52:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:37,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 16:52:37,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 16:52:37,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 16:52:37,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:37,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96509841] [2024-11-08 16:52:37,883 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 16:52:37,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802884594] [2024-11-08 16:52:37,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802884594] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:52:37,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:52:37,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-08 16:52:37,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810894298] [2024-11-08 16:52:37,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:37,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 16:52:37,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:37,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 16:52:37,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:52:37,886 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 16:52:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:38,041 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-11-08 16:52:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:52:38,042 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-08 16:52:38,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:38,042 INFO L225 Difference]: With dead ends: 49 [2024-11-08 16:52:38,043 INFO L226 Difference]: Without dead ends: 23 [2024-11-08 16:52:38,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:52:38,044 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:38,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 378 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:52:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-08 16:52:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-08 16:52:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:52:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-08 16:52:38,046 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 28 [2024-11-08 16:52:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:38,047 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-08 16:52:38,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 16:52:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-08 16:52:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 16:52:38,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:38,052 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:38,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 16:52:38,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:38,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:38,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash -21288017, now seen corresponding path program 1 times [2024-11-08 16:52:38,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:38,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419820431] [2024-11-08 16:52:38,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:38,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:52:38,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:52:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:52:38,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:52:38,291 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:52:38,292 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-08 16:52:38,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-08 16:52:38,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:52:38,298 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-08 16:52:38,318 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:52:38,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:52:38 BoogieIcfgContainer [2024-11-08 16:52:38,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:52:38,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:52:38,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:52:38,323 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:52:38,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:31" (3/4) ... [2024-11-08 16:52:38,326 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:52:38,328 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:52:38,328 INFO L158 Benchmark]: Toolchain (without parser) took 7289.15ms. Allocated memory was 182.5MB in the beginning and 247.5MB in the end (delta: 65.0MB). Free memory was 127.1MB in the beginning and 123.2MB in the end (delta: 3.9MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2024-11-08 16:52:38,328 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 182.5MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:52:38,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.48ms. Allocated memory is still 182.5MB. Free memory was 126.5MB in the beginning and 112.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 16:52:38,329 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.94ms. Allocated memory is still 182.5MB. Free memory was 111.8MB in the beginning and 110.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:52:38,329 INFO L158 Benchmark]: Boogie Preprocessor took 54.97ms. Allocated memory is still 182.5MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:52:38,330 INFO L158 Benchmark]: RCFGBuilder took 457.33ms. Allocated memory is still 182.5MB. Free memory was 108.2MB in the beginning and 92.9MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 16:52:38,330 INFO L158 Benchmark]: TraceAbstraction took 6436.80ms. Allocated memory was 182.5MB in the beginning and 247.5MB in the end (delta: 65.0MB). Free memory was 92.2MB in the beginning and 123.2MB in the end (delta: -31.0MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-11-08 16:52:38,330 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 247.5MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:52:38,332 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 182.5MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.48ms. Allocated memory is still 182.5MB. Free memory was 126.5MB in the beginning and 112.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.94ms. Allocated memory is still 182.5MB. Free memory was 111.8MB in the beginning and 110.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.97ms. Allocated memory is still 182.5MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 457.33ms. Allocated memory is still 182.5MB. Free memory was 108.2MB in the beginning and 92.9MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6436.80ms. Allocated memory was 182.5MB in the beginning and 247.5MB in the end (delta: 65.0MB). Free memory was 92.2MB in the beginning and 123.2MB in the end (delta: -31.0MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 247.5MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 109]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 104. Possible FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -0.2f && IN < 0.2f) [L82] COND FALSE !(!cond) [L98] RET assume_abort_if_not(IN > -0.2f && IN < 0.2f) [L100] CALL, EXPR f(IN) VAL [\old(x)=112] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=112] [L100] RET, EXPR f(IN) VAL [IN=112] [L100] CALL, EXPR fp(IN) VAL [\old(x)=112] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=112] [L100] RET, EXPR fp(IN) VAL [IN=112] [L100] float x = IN - f(IN)/fp(IN); [L102] CALL, EXPR f(x) VAL [\old(x)=110] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=110] [L102] RET, EXPR f(x) VAL [IN=112, x=110] [L102] CALL, EXPR fp(x) VAL [\old(x)=110] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=110] [L102] RET, EXPR fp(x) VAL [IN=112, x=110] [L102] x = x - f(x)/fp(x) [L104] CALL, EXPR f(x) VAL [\old(x)=111] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=111] [L104] RET, EXPR f(x) VAL [IN=112, x=111] [L104] CALL, EXPR fp(x) VAL [\old(x)=111] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=111] [L104] RET, EXPR fp(x) VAL [IN=112, x=111] [L104] x = x - f(x)/fp(x) [L108] COND TRUE !(x < 0.1) VAL [IN=112] [L109] reach_error() VAL [IN=112] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 2397 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2038 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 829 IncrementalHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 359 mSDtfsCounter, 829 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=6, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 355 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 392 ConstructedInterpolants, 0 QuantifiedInterpolants, 1963 SizeOfPredicates, 17 NumberOfNonLiveVariables, 549 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 114/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 16:52:38,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/combinations/gcd_4+newton_3_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad6236f3b1535aee53ef497474ba76faac9143455d497d8d917066c0b5859668 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:52:40,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:52:40,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:52:40,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:52:40,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:52:40,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:52:40,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:52:40,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:52:40,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:52:40,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:52:40,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:52:40,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:52:40,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:52:40,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:52:40,728 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:52:40,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:52:40,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:52:40,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:52:40,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:52:40,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:52:40,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:52:40,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:52:40,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:52:40,733 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:52:40,733 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:52:40,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:52:40,733 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:52:40,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:52:40,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:52:40,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:52:40,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:52:40,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:52:40,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:52:40,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:52:40,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:52:40,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:52:40,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:52:40,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:52:40,740 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 16:52:40,740 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:52:40,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:52:40,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:52:40,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:52:40,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:52:40,741 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad6236f3b1535aee53ef497474ba76faac9143455d497d8d917066c0b5859668 [2024-11-08 16:52:41,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:52:41,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:52:41,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:52:41,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:52:41,095 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:52:41,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_1.i [2024-11-08 16:52:42,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:52:42,760 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:52:42,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i [2024-11-08 16:52:42,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fe8e70b/ce9c7de330d846e0810c0120116d144c/FLAG8c6abd24d [2024-11-08 16:52:42,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06fe8e70b/ce9c7de330d846e0810c0120116d144c [2024-11-08 16:52:42,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:52:42,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:52:42,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:52:42,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:52:42,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:52:42,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:52:42" (1/1) ... [2024-11-08 16:52:42,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f2c9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:42, skipping insertion in model container [2024-11-08 16:52:42,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:52:42" (1/1) ... [2024-11-08 16:52:42,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:52:43,044 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[1224,1237] [2024-11-08 16:52:43,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[2848,2861] [2024-11-08 16:52:43,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:52:43,105 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:52:43,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[1224,1237] [2024-11-08 16:52:43,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[2848,2861] [2024-11-08 16:52:43,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:52:43,156 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:52:43,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43 WrapperNode [2024-11-08 16:52:43,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:52:43,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:52:43,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:52:43,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:52:43,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (1/1) ... [2024-11-08 16:52:43,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (1/1) ... [2024-11-08 16:52:43,205 INFO L138 Inliner]: procedures = 28, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 81 [2024-11-08 16:52:43,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:52:43,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:52:43,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:52:43,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:52:43,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (1/1) ... [2024-11-08 16:52:43,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (1/1) ... [2024-11-08 16:52:43,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (1/1) ... [2024-11-08 16:52:43,240 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-08 16:52:43,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (1/1) ... [2024-11-08 16:52:43,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (1/1) ... [2024-11-08 16:52:43,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (1/1) ... [2024-11-08 16:52:43,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (1/1) ... [2024-11-08 16:52:43,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (1/1) ... [2024-11-08 16:52:43,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (1/1) ... [2024-11-08 16:52:43,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:52:43,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:52:43,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:52:43,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:52:43,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (1/1) ... [2024-11-08 16:52:43,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:52:43,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:52:43,301 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-08 16:52:43,305 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-08 16:52:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:52:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:52:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:52:43,345 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-08 16:52:43,345 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-08 16:52:43,345 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-08 16:52:43,345 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-08 16:52:43,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:52:43,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:52:43,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 16:52:43,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 16:52:43,421 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:52:43,424 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:52:58,188 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 16:52:58,188 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:52:58,202 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:52:58,203 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:52:58,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:58 BoogieIcfgContainer [2024-11-08 16:52:58,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:52:58,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:52:58,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:52:58,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:52:58,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:52:42" (1/3) ... [2024-11-08 16:52:58,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa3d7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:52:58, skipping insertion in model container [2024-11-08 16:52:58,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:43" (2/3) ... [2024-11-08 16:52:58,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa3d7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:52:58, skipping insertion in model container [2024-11-08 16:52:58,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:58" (3/3) ... [2024-11-08 16:52:58,214 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_1.i [2024-11-08 16:52:58,228 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:52:58,228 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 16:52:58,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:52:58,292 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;@644634c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:52:58,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 16:52:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 16:52:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:52:58,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:58,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:58,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:58,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1780387208, now seen corresponding path program 1 times [2024-11-08 16:52:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:52:58,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393465548] [2024-11-08 16:52:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:58,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:58,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:52:58,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:58,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 16:52:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:58,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:52:58,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:58,558 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-08 16:52:58,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:58,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:52:58,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393465548] [2024-11-08 16:52:58,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393465548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:58,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:58,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:58,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822873743] [2024-11-08 16:52:58,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:58,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:58,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:52:58,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:58,597 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 16:52:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:58,752 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2024-11-08 16:52:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:52:58,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-11-08 16:52:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:58,760 INFO L225 Difference]: With dead ends: 90 [2024-11-08 16:52:58,761 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 16:52:58,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:58,767 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:58,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 96 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:52:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 16:52:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-08 16:52:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 16:52:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-08 16:52:58,806 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 11 [2024-11-08 16:52:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:58,806 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-08 16:52:58,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 16:52:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-11-08 16:52:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 16:52:58,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:58,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:58,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 16:52:59,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:59,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:59,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash 413718792, now seen corresponding path program 1 times [2024-11-08 16:52:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:52:59,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086748645] [2024-11-08 16:52:59,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:59,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:59,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:52:59,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:59,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 16:52:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:59,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:52:59,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:59,202 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-08 16:52:59,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:59,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:52:59,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086748645] [2024-11-08 16:52:59,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086748645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:59,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:59,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:59,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001288731] [2024-11-08 16:52:59,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:59,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:59,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:52:59,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:59,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:59,210 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 16:52:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:59,338 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-11-08 16:52:59,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:52:59,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-11-08 16:52:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:59,341 INFO L225 Difference]: With dead ends: 55 [2024-11-08 16:52:59,341 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 16:52:59,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:59,342 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:59,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:52:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 16:52:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-08 16:52:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 16:52:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-08 16:52:59,351 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 13 [2024-11-08 16:52:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:59,351 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-08 16:52:59,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 16:52:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-08 16:52:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 16:52:59,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:59,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:59,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 16:52:59,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:59,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:59,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:59,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1714945339, now seen corresponding path program 1 times [2024-11-08 16:52:59,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:52:59,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279024138] [2024-11-08 16:52:59,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:59,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:59,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:52:59,558 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:59,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 16:52:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:59,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 16:52:59,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:59,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:59,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:59,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:52:59,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279024138] [2024-11-08 16:52:59,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279024138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:59,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:59,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:59,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837975685] [2024-11-08 16:52:59,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:59,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:59,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:52:59,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:59,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:59,992 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-08 16:53:00,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:00,130 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-11-08 16:53:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:53:00,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2024-11-08 16:53:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:00,132 INFO L225 Difference]: With dead ends: 56 [2024-11-08 16:53:00,133 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 16:53:00,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:53:00,135 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:00,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:53:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 16:53:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-08 16:53:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 16:53:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-08 16:53:00,143 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 15 [2024-11-08 16:53:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:00,143 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-08 16:53:00,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-08 16:53:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-08 16:53:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 16:53:00,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:00,145 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:00,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 16:53:00,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:00,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:00,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1030187394, now seen corresponding path program 1 times [2024-11-08 16:53:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:53:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014925908] [2024-11-08 16:53:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:00,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:00,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:53:00,349 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:00,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 16:53:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:00,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:53:00,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:00,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:53:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:01,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:53:01,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014925908] [2024-11-08 16:53:01,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014925908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:53:01,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:53:01,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-08 16:53:01,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152770828] [2024-11-08 16:53:01,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:53:01,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:53:01,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:53:01,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:53:01,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:53:01,348 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-08 16:53:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:01,732 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-11-08 16:53:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:53:01,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 17 [2024-11-08 16:53:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:01,734 INFO L225 Difference]: With dead ends: 60 [2024-11-08 16:53:01,734 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 16:53:01,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:53:01,736 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:01,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:53:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 16:53:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-08 16:53:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 16:53:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-08 16:53:01,744 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 17 [2024-11-08 16:53:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:01,744 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-08 16:53:01,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-08 16:53:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-08 16:53:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 16:53:01,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:01,745 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:01,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-08 16:53:01,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:01,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:01,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:01,950 INFO L85 PathProgramCache]: Analyzing trace with hash -626272964, now seen corresponding path program 2 times [2024-11-08 16:53:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:53:01,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994966335] [2024-11-08 16:53:01,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 16:53:01,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:01,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:53:01,953 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:01,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 16:53:02,028 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 16:53:02,028 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:53:02,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 16:53:02,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:53:04,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:53:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:53:10,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:53:10,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994966335] [2024-11-08 16:53:10,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994966335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:53:10,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:53:10,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-08 16:53:10,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277424861] [2024-11-08 16:53:10,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:53:10,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 16:53:10,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:53:10,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 16:53:10,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:53:10,924 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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-08 16:53:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:15,910 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2024-11-08 16:53:15,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:53:15,915 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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 21 [2024-11-08 16:53:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:15,917 INFO L225 Difference]: With dead ends: 71 [2024-11-08 16:53:15,917 INFO L226 Difference]: Without dead ends: 68 [2024-11-08 16:53:15,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:53:15,919 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:15,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 365 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-08 16:53:15,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-08 16:53:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-11-08 16:53:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 52 states have internal predecessors, (59), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 16:53:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-11-08 16:53:15,931 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 21 [2024-11-08 16:53:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:15,932 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-11-08 16:53:15,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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-08 16:53:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-11-08 16:53:15,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 16:53:15,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:15,933 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:15,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 16:53:16,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:16,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:16,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:16,139 INFO L85 PathProgramCache]: Analyzing trace with hash -311360839, now seen corresponding path program 3 times [2024-11-08 16:53:16,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:53:16,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559806850] [2024-11-08 16:53:16,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 16:53:16,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:16,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:53:16,141 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:16,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 16:53:16,228 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-08 16:53:16,228 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:53:16,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:53:16,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 16:53:16,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:53:16,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:53:16,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559806850] [2024-11-08 16:53:16,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559806850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:16,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:16,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:53:16,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119686672] [2024-11-08 16:53:16,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:16,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:53:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:53:16,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:53:16,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:53:16,319 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 16:53:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:16,418 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2024-11-08 16:53:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:53:16,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 23 [2024-11-08 16:53:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:16,421 INFO L225 Difference]: With dead ends: 78 [2024-11-08 16:53:16,421 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 16:53:16,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:53:16,422 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:16,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:53:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 16:53:16,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2024-11-08 16:53:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 50 states have internal predecessors, (55), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 16:53:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2024-11-08 16:53:16,431 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 23 [2024-11-08 16:53:16,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:16,432 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2024-11-08 16:53:16,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 16:53:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2024-11-08 16:53:16,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 16:53:16,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:16,433 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:16,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 16:53:16,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:16,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:16,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash 603968502, now seen corresponding path program 4 times [2024-11-08 16:53:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:53:16,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65052343] [2024-11-08 16:53:16,639 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 16:53:16,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:16,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:53:16,641 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:16,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 16:53:16,764 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 16:53:16,765 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:53:16,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 16:53:16,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:18,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:53:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:20,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:53:20,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65052343] [2024-11-08 16:53:20,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65052343] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:53:20,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:53:20,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-08 16:53:20,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056677601] [2024-11-08 16:53:20,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:53:20,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 16:53:20,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:53:20,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 16:53:20,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:53:20,332 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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-08 16:53:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:23,681 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2024-11-08 16:53:23,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:53:23,682 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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 25 [2024-11-08 16:53:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:23,683 INFO L225 Difference]: With dead ends: 99 [2024-11-08 16:53:23,683 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 16:53:23,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2024-11-08 16:53:23,685 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:23,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 329 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 16:53:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 16:53:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-08 16:53:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 56 states have internal predecessors, (65), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 16:53:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2024-11-08 16:53:23,700 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 25 [2024-11-08 16:53:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:23,701 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2024-11-08 16:53:23,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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-08 16:53:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2024-11-08 16:53:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 16:53:23,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:23,702 INFO L215 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:23,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-08 16:53:23,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:23,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:23,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash -985782289, now seen corresponding path program 5 times [2024-11-08 16:53:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:53:23,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635913318] [2024-11-08 16:53:23,906 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 16:53:23,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:23,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:53:23,909 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:23,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-08 16:53:23,978 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-08 16:53:23,979 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:53:23,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 16:53:23,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 16:53:25,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:53:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:53:29,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:53:29,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635913318] [2024-11-08 16:53:29,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635913318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:53:29,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:53:29,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2024-11-08 16:53:29,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990765701] [2024-11-08 16:53:29,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:53:29,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:53:29,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:53:29,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:53:29,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:53:29,517 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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-08 16:53:33,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:33,058 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2024-11-08 16:53:33,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:53:33,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 27 [2024-11-08 16:53:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:33,061 INFO L225 Difference]: With dead ends: 104 [2024-11-08 16:53:33,061 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 16:53:33,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:53:33,062 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:33,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 16:53:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 16:53:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-08 16:53:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.169811320754717) internal successors, (62), 56 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 16:53:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2024-11-08 16:53:33,079 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 27 [2024-11-08 16:53:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:33,079 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2024-11-08 16:53:33,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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-08 16:53:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2024-11-08 16:53:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 16:53:33,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:33,080 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:33,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-08 16:53:33,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:33,283 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:33,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1781630816, now seen corresponding path program 1 times [2024-11-08 16:53:33,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:53:33,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097963382] [2024-11-08 16:53:33,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:33,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:33,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:53:33,286 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:33,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-08 16:53:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:33,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 16:53:33,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 16:53:35,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:53:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 16:53:42,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:53:42,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097963382] [2024-11-08 16:53:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097963382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:53:42,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:53:42,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-08 16:53:42,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034534253] [2024-11-08 16:53:42,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:53:42,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 16:53:42,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:53:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 16:53:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:53:42,874 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 18 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 16:53:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:53:47,660 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2024-11-08 16:53:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:53:47,662 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-08 16:53:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:53:47,663 INFO L225 Difference]: With dead ends: 76 [2024-11-08 16:53:47,663 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 16:53:47,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:53:47,664 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:53:47,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 399 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 16:53:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 16:53:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 16:53:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 16:53:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2024-11-08 16:53:47,673 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 28 [2024-11-08 16:53:47,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:53:47,673 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2024-11-08 16:53:47,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 16:53:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2024-11-08 16:53:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 16:53:47,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:53:47,675 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:47,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-08 16:53:47,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:47,879 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:47,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash -21288017, now seen corresponding path program 1 times [2024-11-08 16:53:47,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:53:47,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368313873] [2024-11-08 16:53:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:47,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:47,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:53:47,883 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:47,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process